Practical prefetching via data compression
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Informed prefetching and caching
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Input/output characteristics of scalable parallel applications
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Optimal prefetching via data compression
Journal of the ACM (JACM)
A trace-driven comparison of algorithms for parallel prefetching and caching
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Input/output access pattern classification using hidden Markov models
Proceedings of the fifth workshop on I/O in parallel and distributed systems
Lessons from characterizating the input/output behavior of parallel scientific applications
Performance Evaluation - Special issue on tools for performance evaluation
ARIMA time series modeling and forecasting for adaptive I/O prefetching
ICS '01 Proceedings of the 15th international conference on Supercomputing
Diving Deep: Data-Management and Visualization Strategies for Adaptive Mesh Refinement Simulations
Computing in Science and Engineering
Linear Aggressive Prefetching: A Way to Increase the Performance of Cooperative Caches
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Workload Characterization of Input/Output Intensive Parallel Applications
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
I/O Requirements of Scientific Applications: An Evolutionary View
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Automatic classification of input/output access patterns
Automatic classification of input/output access patterns
Automatic arima time series modeling and forecasting for adaptive input/output prefetching
Automatic arima time series modeling and forecasting for adaptive input/output prefetching
Scalable Input/Output: Achieving System Balance
Scalable Input/Output: Achieving System Balance
Automatic ARIMA Time Series Modeling for Adaptive I/O Prefetching
IEEE Transactions on Parallel and Distributed Systems
On the performance of trace locality of reference
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
CEFT: A cost-effective, fault-tolerant parallel virtual file system
Journal of Parallel and Distributed Computing
Communication Based Proactive Link Power Management
HiPEAC '09 Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers
Markov Model Based Disk Power Management for Data Intensive Workloads
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Efficiently identifying working sets in block I/O streams
Proceedings of the 4th Annual International Conference on Systems and Storage
Storage workload modelling by hidden Markov models: Application to Flash memory
Performance Evaluation
Communication based proactive link power management
Transactions on High-Performance Embedded Architectures and Compilers IV
I/O acceleration with pattern detection
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
| Hi-index | 0.00 |
Given the increasing performance disparity between processors and storage devices, exploiting knowledge of spatial and temporal I/O requests is critical to achieving high performance, particularly on parallel systems. Although perfect foreknowledge of I/O requests is rarely possible, even estimates of request patterns can potentially yield large performance gains. This paper evaluates Markov models to represent the spatial patterns of I/O requests in scientific codes. The paper also proposes three algorithms for I/O prefetching. Evaluation using I/O traces from scientific codes shows that highly accurate prediction of spatial access patterns, resulting in reduced execution times, is possible.