Name
Abstract | ||
|---|---|---|
TaP is a storage cache sequential prefetching and caching technique to improve the read-ahead cache hit rate and system response time. A unique feature of TaP is the use of a table to detect sequential access patterns in the I/O workload and to dynamically determine the optimum prefetch cache size. When compared to some popular prefetching techniques, TaP gives a better hit rate and response time while using a read cache that is often an order of magnitude smaller than that needed by other techniques. TaP is especially efficient when the I/O workload consists of interleaved requests from various applications, where only some of the applications are accessing their data sequentially. For example, TaP achieves the same hit rate as the other techniques with a cache length that is 100 times smaller than the cache needed by other techniques when the interleaved workload consists of 10% sequential application data and 90% random application data. |
Year | Venue | Keywords |
|---|---|---|
2008 | FAST | interleaved workload,hit rate,data sequentially,optimum prefetch cache size,read-ahead cache hit rate,better hit rate,read cache,storage cache sequential prefetching,cache length,table-based prefetching,o workload,raid,disk array |
Field | DocType | Citations |
Cache invalidation,Cache pollution,Cache,CPU cache,Computer science,Parallel computing,Cache algorithms,Real-time computing,Page cache,Cache coloring,Smart Cache | Conference | 27 |
PageRank | References | Authors |
1.21 | 28 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingju Li | 1 | 85 | 7.55 |
| Elizabeth Varki | 2 | 114 | 9.71 |
| Swapnil Bhatia | 3 | 110 | 12.76 |
| Arif Merchant | 4 | 1684 | 133.81 |