Method and System for Record Access in a Distributed System

• US 20150019672A1
• Filed: 07/15/2013
• Published: 01/15/2015
• Est. Priority Date: 07/15/2013
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Hueston, Robert J., Lach, Jorge E., Fuller, Benjamin J.
• Granted Patent: US 9,489,336 B2
• Time in Patent Office: Days
• US Class Current: 709/212
• CPC Class Codes: G06F 15/167 using a common memory, e.g. mailbox
• CPC Class Codes: G06F 21/6227 where protection concerns the structure of data, e.g. records, types, queries
• CPC Class Codes: H04L 9/3228 One-time or temporary data, i.e. information which is sent for every authentication or authorization, e.g. one-time-password, one-time-token or one-time-key

Abstract

A method for record access in a distributed system includes receiving a request for a record, wherein the request comprises a transmitted key and a record identifier, extracting a location identifier and a transmitted pseudorandom portion from the transmitted key, obtaining a stored pseudorandom portion from a location in a key memory specified by the location identifier, and providing access to the record identified by the record identifier when the transmitted pseudorandom portion matches the stored pseudorandom portion.

Claims

1. A method for record access in a distributed system, comprising:

receiving a request for a record, wherein the request comprises a transmitted key and a record identifier;

extracting a location identifier and a transmitted pseudorandom portion from the transmitted key;

obtaining a stored pseudorandom portion from a location in a key memory specified by the location identifier; and

providing access to the record identified by the record identifier when the transmitted pseudorandom portion matches the stored pseudorandom portion.

2. The method of claim 1, further comprising:

obtaining auxiliary data from the key memory; and

processing the auxiliary data.

3. The method of claim 2, wherein the auxiliary data comprises:

a description of a resource accessible based on the key, wherein the resource comprises the record.

4. The method of claim 1, further comprising:

obtaining the record from the home node;

processing the record to obtain the modified record;

storing the first modified record in a write buffer of a plurality of write buffers;

obtaining a first storage status of each of the plurality of write buffers;

initializing, in a first scoreboard, a first plurality of entries corresponding to the plurality of write buffers based on the first storage status; and

for each write of a first modified record from a write buffer of the plurality of write buffers to a home node, clearing a first entry of the first plurality of entries based on the first entry corresponding to the write buffer,

wherein a first checkpoint is complete when each entry of the first plurality of entries is cleared.

5. The method of claim 4, wherein the first scoreboard corresponds to a first thread and wherein the method further comprises:

after initializing the first plurality of entries and after a subset of the first plurality of entries is cleared;

reusing, for a second thread, at least one of the plurality of write buffers for storing a second modified record without modifying the first plurality of entries based on the storing of the second modified record;

obtaining a second storage status of each of the plurality of write buffers;

initializing, in a second scoreboard, a second plurality of entries corresponding to the plurality of write buffers based on the second storage status, wherein the second scoreboard corresponds to the second thread;

for each write of a second modified record from the write buffer of the plurality of write buffers to the home node, clearing a second entry of the second plurality of entries,

wherein a second checkpoint is complete when each entry of the second plurality of entries is cleared.

6. The method of claim 5, wherein the first scoreboard corresponds to a first plurality of threads comprising the first thread, and wherein the second scoreboard corresponds to a second plurality of threads comprising the second thread.

7. A system for record access in a distributed system, comprising:

an authentication module comprising;

key memory configured to store a plurality of pseudorandom portions of a plurality of keys; and

a hardware gatekeeper configured to;

receive a request for a record, wherein the request comprises a transmitted key and a record identifier;

extract a first location identifier and a transmitted pseudorandom portion from the transmitted key;

obtain a stored pseudorandom portion of the plurality of pseudorandom portions from a first location in the key memory specified by the first location identifier; and

provide access to the record identified by the record identifier when the transmitted pseudorandom portion matches the stored pseudorandom portion.

8. The system of claim 7, wherein the key memory is further configured to store:

auxiliary data for storing a description of a resource accessible based on the key, wherein the resource comprises the record.

9. The system of claim 7, further comprising:

a resource manager configured to;

receive a request to generate a new key;

generate a new pseudorandom portion of the new key;

generate a second location identifier based on a free location for storing the new pseudorandom portion;

combine the second location identifier with the new pseudorandom portion to obtain the new key;

store the new pseudorandom portion in a second location specified by the location identifier; and

provide the new key to a requester.

10. The system of claim 7, further comprising:

a storage system for storing a plurality of software instructions of the resource manager.

11. The system of claim 7, further comprising:

a central processing unit; and

a storage system for storing a plurality of records,

wherein providing access to a record identified by the record identifier comprises obtaining the record directly from the storage system while bypassing the central processing unit.

12. The system of claim 7, further comprising:

a storage system for storing a plurality of write buffers;

a first scoreboard comprising a first plurality of entries, wherein each entry of the first plurality of entries corresponds to a write buffer of the plurality of write buffers; and

a first thread configured to;

obtain a first storage status of each of the plurality of write buffers;

initialize, in the first scoreboard, the first plurality of entries based on the first storage status;

for each write of a first modified record from a corresponding write buffer of the plurality of write buffers to a home node, clearing a first entry of the first plurality of entries based on the first entry corresponding to the corresponding write buffer; and

saving a first checkpoint when each entry of the first plurality of entries is cleared.

13. The system of claim 12, further comprising:

a second scoreboard comprising a second plurality of entries, wherein each entry of the second plurality of entries corresponds to a write buffer of the plurality of write buffers; and

a second thread configured to;

after the initializing of the first plurality of entries and after a subset of the first plurality of entries is cleared;

reuse at least one of the plurality of write buffers for storing a second modified record without modifying the first plurality of entries based on the storing of the second modified record;

obtain a second storage status of each of the plurality of write buffers;

initialize, in the first scoreboard, the second plurality of entries based on the second storage status;

for each write of a second modified record from the corresponding write buffer of the plurality of write buffers to the home node, clearing a second entry of the second plurality of entries based on the second entry corresponding to the corresponding write buffer; and

saving a second checkpoint when each entry of the second plurality of entries is cleared.

14. A distributed system for record access, comprising:

a requester node configured to transmit a request for a record, wherein the request comprises a transmitted key and a record identifier; and

a home node comprising;

an authentication module comprising;

key memory configured to store a plurality of pseudorandom portions of a plurality of keys;

a hardware gatekeeper configured to;

receive the request for the record;

extract a first location identifier and a transmitted pseudorandom portion from the transmitted key;

obtain a stored pseudorandom portion of the plurality of pseudorandom portions from a first location in the key memory specified by the first location identifier; and

provide access to a record identified by the record identifier when the transmitted pseudorandom portion matches the stored pseudorandom portion.

15. The distributed system of claim 14, wherein the home node further comprises:

a resource manager configured to;

receive a request for generating a new key;

generate a new pseudorandom portion of the new key;

generate a second location identifier based on a free location for storing the new pseudorandom portion;

combine the second location identifier with the new pseudorandom portion to obtain the new key;

store the new pseudorandom portion in the location; and

provide the new key to a requester.

16. The distributed system of claim 14, wherein the home node further comprises:

a storage system for storing a plurality of software instructions of the resource manager.

17. The distributed system of claim 14, wherein the home node further comprises:

a central processing unit; and

a storage system for storing a plurality of records,

wherein providing access to a record identified by the record identifier comprises obtaining the record directly from the storage system while bypassing the central processing unit.

18. The distributed system of claim 14, wherein the requester node comprises:

a storage system for storing a plurality of write buffers;

a first scoreboard comprising a first plurality of entries, wherein each entry of the first plurality of entries corresponds to a write buffer of the plurality of write buffers; and

a first thread configured to;

obtain a first storage status of each of the plurality of write buffers;

initialize, in the first scoreboard, the first plurality of entries based on the first storage status;

for each write of a first modified record from a corresponding write buffer of the plurality of write buffers to the home node, clearing a first entry of the first plurality of entries based on the first entry corresponding to the corresponding write buffer; and

saving a first checkpoint when each entry of the first plurality of entries is cleared.

19. The distributed system of claim 18, wherein the requester node further comprises:

a second scoreboard comprising a second plurality of entries, wherein each entry of the second plurality of entries corresponds to a write buffer of the plurality of write buffers; and

a second thread configured to;

after the initializing of the first plurality of entries and after a subset of the first plurality of entries is cleared;

reuse at least one of the plurality of write buffers for storing a second modified record without modifying the first plurality of entries based on the storing of the second modified record;

obtain a second storage status of each of the plurality of write buffers;

initialize, in the first scoreboard, the second plurality of entries based on the second storage status;

for each write of a second modified record from the corresponding write buffer of the plurality of write buffers to the home node, clearing a second entry of the second plurality of entries based on the second entry corresponding to the corresponding write buffer; and

saving a second checkpoint when each entry of the second plurality of entries is cleared.

20. The distributed system of claim 19, wherein the first scoreboard corresponds to a first plurality of threads comprising the first thread, and wherein the second scoreboard corresponds to a second plurality of threads comprising the second thread.