Methods and systems for dynamic hashing in caching sub-systems

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.

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.