ACM Transactions on Computer Systems (TOCS)
Disk cache—miss ratio analysis and design considerations
ACM Transactions on Computer Systems (TOCS)
The design of the UNIX operating system
The design of the UNIX operating system
Caching in the Sprite network file system
ACM Transactions on Computer Systems (TOCS)
Sequentiality and prefetching in database systems
ACM Transactions on Database Systems (TODS)
A trace-driven analysis of the UNIX 4.2 BSD file system
Proceedings of the tenth ACM symposium on Operating systems principles
ACM Computing Surveys (CSUR)
Prefetching in segmented disk cache for multi-disk systems
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Automated hoarding for mobile computers
Proceedings of the sixteenth ACM symposium on Operating systems principles
A stochastic disk I/O simulation technique
Proceedings of the 29th conference on Winter simulation
Adaptive Prefetching and Storage Reorganization In A Log-Structured Storage System
IEEE Transactions on Knowledge and Data Engineering
Improving I/O response times via prefetching and storage system reorganization
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Reducing disk I/O times using anticipatory movements of the disk head
Journal of Systems Architecture: the EUROMICRO Journal
The automatic improvement of locality in storage systems
ACM Transactions on Computer Systems (TOCS)
Optimal multistream sequential prefetching in a shared cache
ACM Transactions on Storage (TOS)
Adaptive prefetching algorithm in disk controllers
Performance Evaluation
TaP: table-based prefetching for storage caches
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Z-miner: noise filter in mining frequent access patterns
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
A new disk caching algorithm is presented that uses an adaptive prefetching scheme to reduce the average service time for disk references. Unlike schemes which simply prefetch the next sector or group of sectors, this method maintains information about the order of past disk accesses which is used to accurately predict future access sequences. The range of parameters of this scheme is explored, and its performance is evaluated through trace-driven simulation, using traces obtained from three different UNIX minicomputers. Unlike disk trace data previously described in the literature, the traces used include time stamps for each reference. With this timing information-essential for evaluating any prefetching scheme-it is shown that a cache with the adaptive prefetching mechanism can reduce the average time to service a disk request by a factor of up to three, relative to an identical disk cache without prefetching.