Add to ORKGMost existing studies of file access prediction are experimental in nature and rely on trace driven simulation to predict the performance of the schemes being investigated. We present a first order Markov analysis of file access prediction, discuss its limitations and show how it can be used to estimate the performance of file access predictors, such as First Successor, Last Successor, Stable Successor and Best-k-out-of-n. We compare these analytical results with experimental measurements performed on several file traces and find out that specific workloads, and indeed individual files, can exhibit very different levels of nonstationarity
Modern operating systems use main memory as a cache over disk-based storage. The time spent waiting ...
Recent increases in CPU performance have surpassed those in hard drives. As a result, disk operation...
Recent increases in CPU performance have outpaced increases in hard drive performance. As a result, ...
Abstract—Most existing studies of file access prediction are experimental in nature and rely on trac...
Abstract—Nearly all extant file access predictors attempt to identify the immediate successor to the...
We describe a novel on-line file access predictor, Recent Popularity, capable of rapid adaptation to...
Most modern I/O systems treat each file access independently. However, events in a computer system a...
Existing file access predictors keep track of previous file access patterns and rely on a single heu...
Abstract With the rapid incr system latency is an everaccess costs, which has modern operating syste...
Prediction is a powerful tool for performance and usability. It can reduce access latency for I/O sy...
File prefetching based on previous file access patterns has been shown to be an effective means of r...
An algorithm is proposed for the purpose of optimizing the availability of files to an operating sys...
This work presents an innovative system for analysing and predicting the runtime behaviour of object...
Network File System (NFS, de facto in Linux) or Common Internet File System (CIFS, de facto in Windo...
The prediction of file access times is an important part for the modeling of supercomputer's storage...
Modern operating systems use main memory as a cache over disk-based storage. The time spent waiting ...
Recent increases in CPU performance have surpassed those in hard drives. As a result, disk operation...
Recent increases in CPU performance have outpaced increases in hard drive performance. As a result, ...
Abstract—Most existing studies of file access prediction are experimental in nature and rely on trac...
Abstract—Nearly all extant file access predictors attempt to identify the immediate successor to the...
We describe a novel on-line file access predictor, Recent Popularity, capable of rapid adaptation to...
Most modern I/O systems treat each file access independently. However, events in a computer system a...
Existing file access predictors keep track of previous file access patterns and rely on a single heu...
Abstract With the rapid incr system latency is an everaccess costs, which has modern operating syste...
Prediction is a powerful tool for performance and usability. It can reduce access latency for I/O sy...
File prefetching based on previous file access patterns has been shown to be an effective means of r...
An algorithm is proposed for the purpose of optimizing the availability of files to an operating sys...
This work presents an innovative system for analysing and predicting the runtime behaviour of object...
Network File System (NFS, de facto in Linux) or Common Internet File System (CIFS, de facto in Windo...
The prediction of file access times is an important part for the modeling of supercomputer's storage...
Modern operating systems use main memory as a cache over disk-based storage. The time spent waiting ...
Recent increases in CPU performance have surpassed those in hard drives. As a result, disk operation...
Recent increases in CPU performance have outpaced increases in hard drive performance. As a result, ...