Loading...
Please wait, while we are loading the content...
Similar Documents
Performance comparison of prefetching and placement policies using parallel i/o.
| Content Provider | CiteSeerX |
|---|---|
| Author | Lee, K. K. Kallahalla, M. Lee, B. S. Varman, P. J. |
| Abstract | . We present a simulation study of several prefetching policies to improve the I/O performance of external merging using parallel I/O. In particular we consider traditional sequential prefetch, forecast-based greedy prefetching, and oblivious prefetching. In conjunction with the prefetching policies we evaluate the benefit of two different data placement strategies: run-level striping and block-random placement, in the presence of data skew. We show that the I/O performance is greatly improved by using forecasting techniques. This method outperforms the other policies in achieving higher disk parallelism, and scales well with increased numbers of disks and increasing data skew. Additionally, the performance of block-random data placement is shown to be uniformly good, independent of the data skew, while the performance of run-level striped placement degrades with increasing skew. 1 Introduction The increasing imbalance between the speeds of processors and I/O devices has resulted in t... |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Placement Policy Data Skew Performance Comparison External Merging Simulation Study Placement Degrades Forecast-based Greedy Prefetching Different Data Placement Strategy Traditional Sequential Prefetch Disk Parallelism Run-level Striping Increased Number Block-random Placement Oblivious Prefetching Block-random Data Placement |
| Content Type | Text |
