BLOCK LEVEL STORAGE

• US 20140380007A1
• Filed: 04/30/2012
• Published: 12/25/2014
• Est. Priority Date: 04/30/2012
• Status: Abandoned Application

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Lee, Bu Sung, Suen, Chun-Hui, Kirchberg, Markus
• Application Number:
  US14/371,709
• Publication Number:
  US 20140380007A1
• Time in Patent Office: Days
• US Class Current: 711/162
• CPC Class Codes: G06F 2212/1032 Reliability improvement, data loss prevention, degraded operation etc
• CPC Class Codes: G06F 2212/1048 Scalability
• CPC Class Codes: G06F 2212/263 Network storage, e.g. SAN or NAS
• CPC Class Codes: G06F 3/0604 Improving or facilitating administration, e.g. storage management
• CPC Class Codes: G06F 3/0611 in relation to response time
• CPC Class Codes: G06F 3/0617 in relation to availability
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0647 Migration mechanisms
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Abstract

A storage system comprises a front-end processing subsystem to receive block level storage requests and a plurality of back-end storage nodes coupled to the front-end subsystem. Each of the back-end storage nodes comprises a storage device and a block manager to create, read, update and delete data blocks on the storage device. The front-end processing subsystem maintains a plurality of block reference data structures that are usable by the front-end processing subsystem to access the back-end data storage nodes to provide balancing, redundancy, and scalability to the storage system.

Claims

1. A storage system, comprising:

a front-end processing subsystem to receive block level storage requests; and

a plurality of back-end storage nodes coupled to said front-end subsystem, each of said back-end storage nodes comprising a storage device and an independent block manager to create, read, update and delete data blocks on said storage device;

wherein said front-end processing subsystem is to maintain a block reference data structure that is usable by the front-end processing subsystem to access the back-end data storage nodes to provide balancing, redundancy, and scalability to the storage system.

8. The storage system of claim 1 wherein the front-end processing subsystem receives a read request for a block of data, determines from the block reference tables whether the requested block is stored as multiple copies on the back-end storage subsystem, and issues a request to each back-end storage node determined from the block reference data structure to store a copy of the requested data.

9. The storage system of claim 1 wherein the front-end processing subsystem receives a read request for a block of data from each of multiple requesting systems, determines that the same block of data is targeted by the read requests, and issues a single read request to each back-end storage node containing the targeted block as determined from the block reference data structure.

10. The storage system of claim 1 wherein each of a plurality of back-end storage subsystems store a copy of a block of data and the front-end processing subsystem receives a write request for the block of data, writes to one of said copies, and causes the contents of the one copy to be replicated to all other copies of said block of data.

11. The storage system of claim 1 wherein each of a plurality of back-end storage subsystem store a copy of a read-only copy-on-write (RO COW) block of data, and the front-end processing subsystem receives a write request targeting the RO COW data block and, in response to receiving said write request, said front-end storage subsystem allocates a new data block on each of the plurality of back-end storage subsystems, writes to one of the newly allocated data blocks and causes the written data block to be replicated to all other newly allocated data blocks.

2. The storage system of claim 2 wherein said block reference data structure includes a primary block reference table that includes a reference for each data block stored on the plurality of back-end storage subsystems.

3. The storage system of claim 2 wherein each reference includes a client identifier, a snapshot identifier and a block index.

4. The storage system of claim 2 wherein for a block of data that is resident on the storage devices in multiple instances, the primary block reference table includes an indirection identifier to a secondary block reference table.

5. The storage system of claim 4 wherein the secondary block reference table includes an indirection identifier, a link counter, and one or more block identifiers.

6. The storage system of claim 5 wherein the link counter includes a count value that is indicative of the number of instances of copies of a data block on the storage devices.

7. The storage system of claim 6 wherein the one or more block identifiers include a block identifier for each of the instances of the data block.

12. A storage system, comprising:

a front-end processing subsystem to receive block level storage requests; and

a plurality of back-end storage nodes coupled to said front-end subsystem, each back-end storage subsystem comprising a storage device and an independent block manager to create, read, update and delete data blocks on said storage node;

wherein said front-end processing subsystem is to access a block reference data structure to access the back-end data storage systems to determine which back-end storage nodes to access to complete received block level storage requests.

13. The storage system of claim 12 wherein said block reference data structure includes a primary block reference table that includes a reference for each data block stored on the plurality of back-end storage subsystems and a secondary block reference table that, for a block of data that is resident on the storage subsystems in multiple instances, the primary block reference table includes an indirection identifier to the secondary block reference table.

14. A method, comprising:

receiving a write block access request for a read-only block of data;

determining whether the block of data is to be copied upon writing the block of data;

allocating a first new block of data on a first back-end storage node;

writing the data to the first new allocated block of data;

allocating a second new block of data on another back-end storage node; and

copying contents of the first new allocated block of data from the first back-end storage node to the second new allocated block of data on the other back-end storage node.

15. The method of claim 14 wherein copying the contents of the first new allocated block of data from the first back-end storage node to the second new allocated block of data on the other back-end storage node may occur or continue to occur after writing to the first new allocated block of data has completed.