Queueing storage operations

US12242896B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12242896-B2
Application numberUS-202318400952-A
CountryUS
Kind codeB2
Filing dateDec 29, 2023
Priority dateSep 7, 2016
Publication dateMar 4, 2025
Grant dateMar 4, 2025

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.

A method of scheduling input/output operations for a storage system including determining a deadline for a storage operation, wherein the deadline is dependent on an expected latency of the storage operation; adding the storage operation to a queue of storage operations; and reordering the queue dependent upon the deadline of the storage operation and one or more deadlines of one or more storage operations in the queue of storage operations.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: determining, for a storage operation in a queue that includes one or more other storage operations, a deadline based on expected latency, wherein the storage operation and the one or more other storage operations are associated with a same entity; and reordering the queue based on the determined deadline for the storage operation and one or more other deadlines for the one or more other storage operations in the queue. 2. The method of claim 1 , wherein determining a deadline comprises combining the expected latency of the storage operation and a current time. 3. The method of claim 2 , wherein the current time is a proxy for time. 4. The method of claim 1 , wherein the queue of storage operations comprises storage operations of a single storage operation type. 5. The method of claim 1 , wherein the queue of storage operations comprises storage operations for a single storage die of a storage device. 6. The method of claim 1 , wherein the queue of storage operations comprises storage operations for a single communication channel of a storage device. 7. The method of claim 1 , wherein the queue is reordered in an ascending order of deadlines for the storage operation and the one or more other storage operations. 8. A non-transitory computer readable storage medium storing instructions, which when executed, cause a processing device of a storage controller to: determine, for a storage operation in a queue that includes one or more other storage operations, a deadline based on expected latency, wherein the storage operation and the one or more other storage operations are associated with a same entity; and reorder the queue based on the determined deadline for the storage operation and one or more other deadlines for the one or more other storage operations in the queue. 9. The non-transitory computer readable storage medium of claim 8 , wherein determining a deadline comprises combining the expected latency of the storage operation and a current time. 10. The non-transitory computer readable storage medium of claim 9 , wherein the current time is a proxy for time. 11. The non-transitory computer readable storage medium of claim 8 , wherein the queue of storage operations comprises storage operations of a single storage operation type. 12. The non-transitory computer readable storage medium of claim 8 , wherein the queue of storage operations comprises storage operations for a single storage die of a storage device. 13. The non-transitory computer readable storage medium of claim 8 , wherein the queue of storage operations comprises storage operations for a single communication channel of a storage device. 14. The non-transitory computer readable storage medium of claim 8 , wherein the queue is reordered in an ascending order of deadlines for the storage operation and the one or more other storage operations. 15. A storage system comprising: a plurality of storage devices; and a storage controller operatively coupled to the storage devices, the storage controller comprising a processing device, the processing device configured to: determine, for a storage operation in a queue that includes one or more other storage operations, a deadline based on expected latency, wherein the storage operation and the one or more other storage operations are associated with a same entity y; and reorder the queue based on the determined deadline for the storage operation and one or more other deadlines for the one or more other storage operations in the queue. 16. The storage system of claim 15 , wherein determining a deadline comprises combining the expected latency of the storage operation and a current time. 17. The storage system of claim 16 , wherein the current time is a proxy for time. 18. The storage system of claim 15 , wherein the queue of storage operations comprises storage operations of a single storage operation type. 19. The storage system of claim 15 , wherein the queue of storage operations comprises storage operations for a single storage die of a storage device. 20. The storage system of claim 15 , wherein the queue is reordered in an ascending order of deadlines for the storage operation and the one or more other storage operations.

Assignees

Inventors

Classifications

  • with request queuing · CPC title

  • G06F13/16Primary

    for access to memory bus (G06F13/28 takes precedence) · CPC title

  • involving deadlines, e.g. rate based, periodic · CPC title

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

  • at area level, e.g. provisioning of virtual or logical volumes · 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 US12242896B2 cover?
A method of scheduling input/output operations for a storage system including determining a deadline for a storage operation, wherein the deadline is dependent on an expected latency of the storage operation; adding the storage operation to a queue of storage operations; and reordering the queue dependent upon the deadline of the storage operation and one or more deadlines of one or more storag…
Who is the assignee on this patent?
Pure Storage Inc
What technology area does this patent fall under?
Primary CPC classification G06F13/16. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Mar 04 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).