Autonomous I/O ingestion and data flushing among nodes in storage systems

US11836362B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11836362-B2
Application numberUS-202217585121-A
CountryUS
Kind codeB2
Filing dateJan 26, 2022
Priority dateJan 26, 2022
Publication dateDec 5, 2023
Grant dateDec 5, 2023

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.

Nodes in a storage system can autonomously ingest I/O requests and flush data to storage. First and second nodes determine a sequence separator, the sequence separator corresponding to an entry in a page descriptor ring that separates two flushing work sets (FWS). The first node receives an input/output (I/O) request and allocates a sequence identification (ID) number to the I/O request. The first node determines a FWS for the I/O request based on the sequence separator and the sequence ID number, and commits the I/O request using the sequence ID number. The I/O request and the sequence ID number are sent to the second node.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for nodes in a storage system to autonomously ingest I/O requests, the method comprising: determining, by a first node and a second node, a sequence separator, the sequence separator corresponding to an entry in a page descriptor ring that separates two flushing work sets (FWS); receiving, by a first node, an input/output (I/O) request; allocating, by the first node, a sequence identification (ID) number to the I/O request; determining, by the first node, a FWS for the I/O request based on the sequence separator and the sequence ID number; committing, by the first node, the I/O request using the sequence ID number; and sending, by the first node, the I/O request and the sequence ID number to the second node. 2. The method of claim 1 , further comprising: determining, by the first node, another sequence separator that separates one of the two FWSs from a third FWS by adding a predetermined value to the sequence separator. 3. The method of claim 1 , further comprising: determining, by the second node, another sequence separator that separates one of the two FWSs from a third FWS by adding a predetermined value to the sequence separator. 4. The method of claim 1 , further comprising: after determining the FWS for the I/O request, incrementing, by the first node, a counter for pending I/O requests for the FWS. 5. The method of claim 2 , further comprising: after committing the I/O request using the sequence ID number, decrementing, by the first node, the counter for pending I/O requests for the FWS. 6. The method of claim 1 , further comprising: comparing a counter for pending I/O requests for the FWS to zero (0); and flushing data associated with the FWS to storage if the counter is equal to 0. 7. The method of claim 1 , further comprising: comparing, by the second node, the sequence ID number received from the first node to the sequence separator; and identifying, by the second node, an FWS for the I/O request based on the comparison. 8. The method of claim 7 , further comprising: determining, by the second node, whether the sequence ID number has been allocated on the second node. 9. The method of claim 8 , further comprising: if the sequence ID number has not been allocated on the second node, allocating the sequence ID number on the second node to the I/O request. 10. The method of claim 8 , further comprising: if the sequence ID number has been allocated on the second node, selecting an unallocated sequence ID number associated with the FWS identified based on the comparison between the sequence ID number and the sequence separator; and allocating the unallocated sequence ID number to the I/O request. 11. A storage system with nodes that autonomously ingest I/O requests, the system including a processor configured to: determine, by a first node and a second node, a sequence separator, the sequence separator corresponding to an entry in a page descriptor ring that separates two flushing work sets (FWS); receive, at the first node, an input/output (I/O) request; allocate, at the first node, a sequence identification (ID) number to the I/O request; determine, at the first node, a FWS for the I/O request based on the sequence separator and the sequence ID number; commit, at the first node, the I/O request using the sequence ID number; and send, by the first node, the I/O request and the sequence ID number to the second node. 12. The storage system of claim 11 , the processor further configured to: determine, at the first node, another sequence separator that separates one of the two FWSs from a third FWS by adding a predetermined value to the sequence separator. 13. The storage system of claim 11 , the processor further configured to: determine, at the second node, another sequence separator that separates one of the two FWSs from a third FWS by adding a predetermined value to the sequence separator. 14. The storage system of claim 11 , the processor further configured to: after determining the FWS for the I/O request, increment, at the first node, a counter for pending I/O requests for the FWS. 15. The storage system of claim 12 , the processor further configured to: after committing the I/O request using the sequence ID number, decrement, at the first node, the counter for pending I/O requests for the FWS. 16. The storage system of claim 11 , the processor further configured to: compare a counter for pending I/O requests for the FWS to zero (0); and flush data associated with the FWS to storage if the counter is equal to 0. 17. The storage system of claim 11 , the processor further configured to: compare, at the second node, the sequence ID number received from the first node to the sequence separator; and identify, at the second node, an FWS for the I/O request based on the comparison. 18. The storage system of claim 17 , the processor further configured to: determine, at the second node, whether the sequence ID number has been allocated on the second node. 19. The storage system of claim 18 , the processor further configured to: if the sequence ID number has not been allocated on the second node, allocate the sequence ID number on the second node to the I/O request. 20. The storage system of claim 18 , the processor further configured to: if the sequence ID number has been allocated on the second node, select an unallocated sequence ID number associated with the FWS identified based on the comparison between the sequence ID number and the sequence separator; and allocate the unallocated sequence ID number to the I/O request.

Assignees

Inventors

Classifications

  • G06F3/0631Primary

    by allocating resources to storage systems · CPC title

  • Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

  • in relation to response time · CPC title

  • Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket · CPC title

  • Command handling arrangements, e.g. command buffers, queues, command scheduling · 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 US11836362B2 cover?
Nodes in a storage system can autonomously ingest I/O requests and flush data to storage. First and second nodes determine a sequence separator, the sequence separator corresponding to an entry in a page descriptor ring that separates two flushing work sets (FWS). The first node receives an input/output (I/O) request and allocates a sequence identification (ID) number to the I/O request. The fi…
Who is the assignee on this patent?
Dell Products Lp
What technology area does this patent fall under?
Primary CPC classification G06F3/0631. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Dec 05 2023 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 5 related publications on this page (citations in our corpus or others sharing the same primary CPC).