Methods and systems for dynamic hashing in caching sub-systems

US10481835B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10481835-B2
Application numberUS-201414510829-A
CountryUS
Kind codeB2
Filing dateOct 9, 2014
Priority dateOct 9, 2014
Publication dateNov 19, 2019
Grant dateNov 19, 2019

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.

Methods and systems for dynamic hashing in cache sub-systems are provided. The method includes analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data, where for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value.

First claim

Opening claim text (preview).

What is claimed is: 1. A machine implemented method, comprising: analyzing a plurality of input/output (I/O) requests to determine a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 2. The method of claim 1 , further comprising: reconfiguring a set of cache blocks when input to the hashing function changes from the first input to the second input; wherein one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 3. The method of claim 2 , wherein the reconfiguring comprises: selecting a Logical Block Address (LBA) range for reconfiguring a subset of cache blocks; locking a stripe associated with the subset of cache blocks to deny access to the subset of cache blocks that are being re-configured; associating each of the subset of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 4. The method of claim 3 , further comprising: tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 5. The method of claim 1 , further comprising: determining a subset of cache blocks within a set of cache blocks associated with a new I/O request; and processing the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 6. The method of claim 5 , further comprising: processing the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 7. The method of claim 6 , further comprising: queueing the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. 8. A non-transitory machine readable medium having stored thereon instructions for performing a method comprising machine executable code which when executed by at least one machine, causes the machine to: analyze a plurality of input/output (I/O) requests to determine a pattern indicating if the I/O requests are random or sequential; and use the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 9. The non-transitory machine readable medium of claim 8 , wherein the instructions further cause the machine to: reconfigure a set of cache blocks when input to the hashing function changes from the first input to the second input, where one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 10. The non-transitory machine readable medium of claim 9 , wherein the reconfiguration comprises: selecting a Logical Block Address (LBA) range for reconfiguring a subset of cache blocks; locking a stripe associated with the subset of cache blocks to deny access to the subset of cache blocks that are being re-configured; associating each of the subset of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 11. The non-transitory machine readable medium of claim 10 , wherein the reconfiguration further comprises: tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 12. The non-transitory machine readable medium of claim 8 , wherein the instructions further cause the machine to: determine a subset of cache blocks within the set of cache blocks associated with a new I/O request; and process the new I/O request using the second hash index value when reconfiguration has been completed for the subset of cache blocks. 13. The non-transitory machine readable medium of claim 12 , wherein the instructions further cause the machine to: process the new I/O request using the first hash index value, when reconfiguration has not been started for the subset of cache blocks. 14. The non-transitory machine readable medium of claim 13 , wherein the instructions further cause the machine to: queue the new I/O request until a lock has been released indicating that reconfiguration has been completed for the subset of cache blocks. 15. A system comprising: a memory containing machine readable medium comprising machine executable code having stored thereon instructions; and a processor coupled to the memory, the processor configured to execute the machine executable code to cause the processor to: analyze a plurality of input/output (I/O) requests to determine a pattern indicating if the I/O requests are random or sequential; and use the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a hashing data structure to look up a cache block to cache an I/O request to read or write data; wherein for random I/O requests, a segment size is the first input to a hashing function to compute a first hash index value and for sequential I/O requests, a stripe size is used as the second input for computing a second hash index value. 16. The system of claim 15 , wherein the processor further executes the machine executable code to: reconfigure a set of cache blocks when input to the hashing function changes from the first input to the second input, where one or more of the set of cache blocks remain accessible using the first hash index value and one or more of the set of cache blocks is accessible using the second hash index value. 17. The system of claim 16 , wherein the reconfiguration comprises: selecting a Logical Block Address (LBA) range for reconfiguring a subset of cache blocks; locking a stripe associated with the subset of cache blocks to deny access to the subset of cache blocks that are being re-configured; associating each of the subset of cache blocks with hash buckets of the hashing data structure based on the second hash index value; and unlocking the stripe associated with the subset of cache blocks. 18. The system of claim 17 , wherein the reconfiguration further comprises: tracking a reconfiguration boundary that indicates which cache blocks have been reconfigured for processing I/O requests using either the first hash index value or the second hash index value. 19. The system of claim 15 , wherein the processor f

Assignees

Inventors

Classifications

  • G06F3/067Primary

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

  • Organizing or formatting or addressing of data · CPC title

  • in relation to response time · CPC title

  • Data transfer between cache memory and other subsystems, e.g. storage devices or host systems · 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 US10481835B2 cover?
Methods and systems for dynamic hashing in cache sub-systems are provided. The method includes analyzing a plurality of input/output (I/O) requests for determining a pattern indicating if the I/O requests are random or sequential; and using the pattern for dynamically changing a first input to a second input for computing a hash index value by a hashing function that is used to index into a has…
Who is the assignee on this patent?
Netapp Inc
What technology area does this patent fall under?
Primary CPC classification G06F3/067. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Nov 19 2019 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 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).