Performance consequences of parity placement in disk arrays
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
A status report on research in transparent informed prefetching
ACM SIGOPS Operating Systems Review
The Performance of Parity Placements in Disk Arrays
IEEE Transactions on Computers
Heuristics for Scheduling I/O Operations
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
This paper describes the collection and analysis of super- computer I/O traces and their use in a collection of buffering and caching simulations. This serves two purposes. First, it gives a model of how individual applications running on supercomputers request file system I/O, allowing system designers to optimize I/O hardware and file system algorithms to that model. Second, the buffering simulations show what resources are needed to maximize the CPU utilization of a super- computer given a very bursty I/O request rate. By using read-ahead and write-behind in a large solid state disk, one or two applications were sufficient to fully utilize a Cray Y-MP CPU.