Allowing client systems to interpret higher-revision data structures in storage systems

• US 20040003055A1
• Filed: 02/21/2003
• Published: 01/01/2004
• Est. Priority Date: 03/29/2002
• Status: Active Grant

• Current Assignee: Denis M. Serenyi, Mark C. Holland
• Original Assignee: Denis M. Serenyi, Mark C. Holland
• Inventors: Serenyi, Denis M., Holland, Mark C.
• Granted Patent: US 8,095,503 B2
• Time in Patent Office: Days
• US Class Current: 709/219
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: G06F 16/289 Object oriented databases

Abstract

A method for allowing client computers in a distributed object-based data storage system to interpret higher revision data structures. In one embodiment, clients request layout maps of objects to be accessed from respective storage managers in the system and then construct and execute directed acyclic graphs (DAG) to accomplish desired I/O operations for data access. When a client computer running an older software revision is not able to interpret a particular data organization supplied by the storage manager that was designed after that client'"'"'s software was installed, the client sends to the storage manager a description of the desired data access operation. The storage manager, in turn, interprets a data layout scheme for a client on a per-access basis and returns to that client a DAG containing a data structure that describes the sequence of I/O operations necessary to effect the data access. The client can then execute the storage manager-supplied DAG to carry out the data access.

Claims

1. A method of accessing data in an object-based data storage system including a first computer and a second computer, said method comprising:

said first computer obtaining a data access map from said second computer, wherein said data access map contains information to be interpreted by said first computer to perform said data access;

said first computer interpreting said data access map so as to determine a first set of operations needed to be performed by said first computer for accessing said data; and

said first computer performing said first set of operations and a second set of operations to access said data.

2. The method of claim 1, wherein said data access map includes a layout map describing how one or more objects to be accessed during said data access are stored in said data storage system, and wherein said layout map contains at least one of the following:

a first information about a storage layout scheme for said one or more objects;

a second information about which one or more of a plurality of storage disks in said data storage system are used to store said one or more objects; and

a third information about the number of disks from said plurality of storage disks that are used to store said one or more objects.

3. The method of claim 1, wherein said first computer performing said first set of operations includes at least one of the following:

said first computer computing, using said data access map, one or more physical disk locations in one or more of a plurality of storage disks in said data storage system that need to be accessed for said data access; and

said first computer further computing one or more byte offsets for accessing said data in said one or more of said plurality of storage disks.

4. The method of claim 1, wherein said first computer performing said second set of operations includes:

said first computer constructing a directed acyclic graph (DAG) after interpreting said information in said data access map, wherein said DAG identifies a sequence for said second set of operations needed to be performed by said first computer for accessing said data; and

said first computer executing said DAG to perform said second set of operations in said sequence.

5. A method of accessing data in an object-based distributed data storage system comprising:

obtaining a data access map that contains information about said data access;

interpreting said data access map so as to determine one or more operations needed to be performed as part of accessing said data; and

performing said one or more operations as part of accessing said data.

6. In an object-based data storage system including a plurality of client computers and a server computer, wherein each of said plurality of client computers is configured to perform a corresponding data access to a storage disk in said data storage system, a method of accessing data in said storage disk comprising:

each of said plurality of client computers constructing a corresponding directed acyclic graph (DAG), wherein each said corresponding DAG identifies a sequence for a respective first set of operations needed to be performed by corresponding client computer for said corresponding data access; and

each of said plurality of client computers executing said corresponding DAG to perform said respective first set of operations in said sequence for said corresponding data access.

7. The method of claim 6, further comprising:

each of said plurality of client computers obtaining a respective data access map from said server computer, wherein each said respective data access map contains information to be interpreted by a corresponding client computer to determine a respective second set of operations needed to be performed by said client computer as part of said corresponding data access; and

each of said plurality of client computers performing said respective second set of operations.

8. A method of accessing data in an object-based data storage system including a first computer and a second computer, said method comprising:

said first computer obtaining a data access map from said second computer, wherein said data access map contains information to be interpreted by said first computer to perform said data access;

in the event that said first computer being unable to interpret said data access map, said first computer notifying said second computer of a data access operation needed to be performed by said first computer to access said data;

said second computer constructing a directed acyclic graph (DAG) based on said information contained in said data access map, wherein said DAG identifies a sequence of I/O operations for said data access operation needed to be performed by said first computer to access said data;

said second computer sending said DAG to said first computer; and

said first computer executing said DAG to perform said I/O operations in said sequence so as to access said data.

9. A method of accessing data in an object-based data storage system comprising:

receiving a request from a requestor describing a data access operation needed to be performed by said requester to access said data in said data storage system;

constructing a directed acyclic graph (DAG) in response to said request using information contained in a data access map corresponding to said data access to be performed by said requester, wherein said DAG identifies a sequence of I/O operations for said data access operation needed to be performed by said requestor to access said data;

sending said DAG to said requestor; and

configuring said requester to execute said DAG to perform said I/O operations in said sequence so as to access said data.

10. A computer-readable storage medium containing a program code, which, upon execution by a processor in an object-based distributed data storage system, causes said processor to perform the following:

receive a request from a requestor describing a data access operation needed to be performed by said requestor to access data in said data storage system;

construct a directed acyclic graph (DAG) in response to said request using information contained in a data access map corresponding to said data access to be performed by said requester, wherein said DAG identifies a sequence of I/O operations for said data access operation needed to be performed by said requester to access said data; and

send said DAG to said requestor.

11. An object-based data storage system comprising:

means for receiving a request from a requestor describing a data access operation needed to be performed by said requestor to access data in said data sorage system;

means for constructing a directed acyclic graph (DAG) in response to said request using information contained in a data access map corresponding to said data access to be performed by said requestor, wherein said DAG identifies a sequence of I/O operations for said data access operation needed to be performed by said requestor to access said data;

means for sending said DAG to said requester; and

means for configuring said requestor to execute said DAG to perform said I/O operations in said sequence so as to access said data.