loading...
A Study of Parallel Prefetching Algorithms Using Trace-Driven Simulation
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.52Sixth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dingqing Hu, Huazhong University of Science and Technology,Wuhan,China
Changsheng Xie, Huazhong University of Science and Technology,Wuhan,China
CaiBin CaiBin, Huazhong University of Science and Technology,Wuhan,China
I/O for parallel and distributed systems has drawn increasing attention over the past decade as it has become apparent that I/O performance, rather than CPU performance, may be the key limiting factor in the performance of future systems. Prefetch is the fundamental approach for improving the overall read performance. In this paper, we study three parallel prefetching algorithms-LRU-Lookahead, Fixed Horizon, and Greedy algorithmin, and explore the performance characteristics of each of the algorithms using the trace-driven simulation.
Citation:
Dingqing Hu, Changsheng Xie, CaiBin CaiBin, "A Study of Parallel Prefetching Algorithms Using Trace-Driven Simulation," pdcat, pp.476-478, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.