Mass prefetching method for disk array

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 185
  • Download : 0
DC FieldValueLanguage
dc.description.abstractDisclosed herein is a mass prefetching method for disk arrays. In order to improve disk read performance for a non-sequential with having spatial locality as well as a sequential read, when a host requests a block to be read, all the blocks of the strip to which the block belongs are read. This is designated as strip prefetching (SP). Throttled Strip Prefetching (TSP), proposed in the present invention, investigates whether SP is beneficial by an online disk simulation, and does not perform SP if it is determined that SP is not beneficial. Since all prefetching operations of TSP are aligned in the strip of the disk array, the disk independence loss is resolved, and thus the performance of disk arrays is improved for concurrent sequential reads of multiple processes. TSP may however suffer from the loss of disk parallelism due to the disk independence of SP for a single sequential read. In order to solve this problem, this invention proposes Massive Stripe Prefetching (MSP). MSP includes an algorithm that detects a single sequential read at the block level. When a single sequential read is detected, prefetching is aligned in a stripe, and the prefetching size is set to a multiple of stripe size. Accordingly, the parallelism of disks is maximized.-
dc.titleMass prefetching method for disk array-
Appears in Collection
Files in This Item
There are no files associated with this item.


  • mendeley


rss_1.0 rss_2.0 atom_1.0