I/O accelerator for striped disk arrays using parity

US10067682B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-10067682-B1
Application numberUS-201615185522-A
CountryUS
Kind codeB1
Filing dateJun 17, 2016
Priority dateApr 18, 2011
Publication dateSep 4, 2018
Grant dateSep 4, 2018

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Disclosed herein is an enhanced volume manager (VM) for a storage system that accelerates input/output (I/O) performance for random write operations to a striped disk array using parity. More specifically, various implementations are directed to accelerating “random writes” (writes comprising less than a complete stripe of data) by consolidating several random writes together to create a “sequential write” (a full-stripe write) to eliminate one or more read operations and/or increase the volume of new/updated data stored for each write operation. Several such implementations comprise functionality in the VM (volume manager) for identifying random write I/O requests, queuing them locally in a journal, and then periodically flushing the journal to the disk array as a sequential write request.

First claim

Opening claim text (preview).

What is claimed is: 1. A non-transitory computer-readable medium having computer-executable instructions stored thereon for accelerating I/O performance for a striped-disk array that, when executed by a storage computer, cause the storage computer to: receive a write I/O request directed to a portion of a stripe of the striped-disk array; determine, prior to any forwarding of the received write I/O request to the striped-disk array, whether the write I/O request is random or sequential by comparing the write I/O request to a plurality of recent I/O requests; in response to determining that the write I/O request is random, record the random write I/O request in a journal data storage area of the striped-disk array; and periodically flush the journal data storage area by forming a sequential write I/O that spans a width of a stripe of the striped-disk array, the formed sequential write I/O comprising the random write I/O request and at least one other random write I/O request that is recorded in the journal data storage area. 2. The non-transitory computer-readable medium of claim 1 , having further computer-executable instructions stored thereon that, when executed by the storage computer, cause the storage computer to forward the sequential write I/O request to the striped-disk array in response to determining that the write I/O request is sequential. 3. The non-transitory computer-readable medium of claim 1 , having further computer-executable instructions stored thereon that, when executed by the storage computer, cause the storage computer to: forward the formed sequential write I/O to the striped-disk array. 4. The non-transitory computer-readable medium of claim 3 , wherein the journal data storage area is periodically flushed in order to maintain a predetermined amount of storage capacity in the journal data storage area to accommodate incoming write I/O requests. 5. The non-transitory computer-readable medium of claim 3 , wherein the journal data storage area is periodically flushed at a time that minimizes impact on incoming I/O requests. 6. The non-transitory computer-readable medium of claim 1 , having further computer-executable instructions stored thereon that, when executed by the storage computer, cause the storage computer to: maintain a journal table including a plurality of entries; and in response to determining that the write I/O request is random, update an entry in the journal table corresponding to the random write I/O operation to indicate a location in the journal data storage area and the portion of the stripe of the striped-disk array to which the random write I/O request is directed. 7. The non-transitory computer-readable medium of claim 6 , having further computer-executable instructions stored thereon that, when executed by the storage computer, cause the storage computer to: receive a read I/O request; determine whether the journal table includes an entry corresponding to the read I/O request; upon determining that the journal table includes an entry corresponding to the read I/O request, service at least a portion of the read I/O request from the journal data storage area; and upon determining that the journal table does not include an entry corresponding to the read I/O request, forward the read I/O request to the striped-disk array. 8. The non-transitory computer-readable medium of claim 7 , having further computer-executable instructions stored thereon that, when executed by the storage computer, cause the storage computer to: partition a storage capacity of the striped-disk array into zones; maintain an accelerated zone table comprising entries that relate the zones to corresponding entries in the journal table; determine a zone of the striped-disk array to which the read I/O request is directed; and determine whether the journal table includes an entry corresponding to the read I/O request by searching the accelerated zone table based on the zone of the striped-disk array to which the read I/O request is directed. 9. A method for accelerating I/O performance for a striped-disk array, comprising: receiving a write I/O request directed to a portion of a stripe of the striped-disk array; determining, prior to any forwarding of the received write I/O request to the striped-disk array, whether the write I/O request is random or sequential by comparing the write I/O request to a plurality of recent I/O requests; in response to determining that the write I/O request is random, recording the random write I/O request in a journal data storage area of the striped-disk array; and periodically flushing the journal data storage area by forming a sequential write I/O that spans a width of a stripe of the striped-disk array, the formed sequential write I/O comprising the random write I/O request and at least one other random write I/O request that is recorded in the journal data storage area. 10. The method of claim 9 further comprising forwarding the sequential write I/O request to the striped-disk array in response to determining that the write I/O request is sequential. 11. The method of claim 9 further comprising: forwarding the formed sequential write I/O to the striped-disk array. 12. The method of claim 11 , wherein the journal data storage area is periodically flushed in order to maintain a predetermined amount of storage capacity in the journal data storage area to accommodate incoming write I/O requests. 13. The method of claim 11 , wherein the journal data storage area is periodically flushed at a time that minimizes impact on incoming I/O requests. 14. The method of claim 9 , further comprising: maintaining a journal table including a plurality of entries; and in response to determining that the write I/O request is random, updating an entry in the journal table corresponding to the random write I/O operation to indicate a location in the journal data storage area and the portion of the stripe of the striped-disk array to which the random write I/O request is directed. 15. The method of claim 14 , further comprising: receiving a read I/O request; determining whether the journal table includes an entry corresponding to the read I/O request; upon determining that the journal table includes an entry corresponding to the read I/O request, servicing at least a portion of the read I/O request from the journal data storage area; and upon determining that the journal table does not include an entry corresponding to the read I/O request, forwarding the read I/O request to the striped-disk array. 16. The method of claim 15 , further comprising: partitioning a storage capacity of the striped-disk array into zones; maintaining an accelerated zone table comprising entries that relate the zones to corresponding entries in the journal table; determining a zone of the striped-disk array to which the read I/O request is directed; and determining whether the journal table includes an entry corresponding to the read I/O request further comprises searching the accelerated zone table based on the zone of the striped-disk array to which the read I/O request is directed. 17. A storage computer for accelerating I/O performance for a striped-disk array, comprising: a processing unit; and a memory communicatively connected to the processing unit that stores computer-executable instructions that, when executed by the processing unit, cause the storage computer to: receive a write I/O request directed to a portion of a stripe of the striped-disk array; determine, prior to any forwarding of the received write I/O request to t

Assignees

Inventors

Classifications

  • Parity-small-writes, i.e. improved small or partial write techniques in RAID systems · CPC title

  • Disk arrays, e.g. RAID, JBOD · CPC title

  • Fast writes, i.e. signaling the host that a write is done before data is written to disk · CPC title

  • Metadata, i.e. metadata associated with RAID systems with parity · CPC title

  • LFS, i.e. Log Structured File System used in RAID systems with parity · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10067682B1 cover?
Disclosed herein is an enhanced volume manager (VM) for a storage system that accelerates input/output (I/O) performance for random write operations to a striped disk array using parity. More specifically, various implementations are directed to accelerating “random writes” (writes comprising less than a complete stripe of data) by consolidating several random writes together to create a “seque…
Who is the assignee on this patent?
American Megatrends Inc
What technology area does this patent fall under?
Primary CPC classification G06F3/061. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Sep 04 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).