
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Mahesh Kallahalla, Peter J. Varman, "PCOPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems," IEEE Transactions on Computers, vol. 51, no. 11, pp. 13331344, November, 2002.  
BibTex  x  
@article{ 10.1109/TC.2002.1047757, author = {Mahesh Kallahalla and Peter J. Varman}, title = {PCOPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {11}, issn = {00189340}, year = {2002}, pages = {13331344}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1047757}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  PCOPT: Optimal Offline Prefetching and Caching for Parallel I/O Systems IS  11 SN  00189340 SP1333 EP1344 EPD  13331344 A1  Mahesh Kallahalla, A1  Peter J. Varman, PY  2002 KW  Parallel I/O systems KW  caching KW  prefetching KW  scheduling KW  buffer management KW  competitive ratio KW  algorithms KW  online algorithm KW  offline algorithm. VL  51 JA  IEEE Transactions on Computers ER   
Abstract—We address the problem of prefetching and caching in a parallel I/O system and present a new algorithm for parallel disk scheduling. Traditional buffer management algorithms that minimize the number of block misses are substantially suboptimal in a parallel I/O system where multiple I/Os can proceed simultaneously. We show that in the offline case, where a priori knowledge of all the requests is available,
[1] A. Aggarwal and J. S. Vitter, The Input/Output Complexity of Sorting and related Problems Comm. ACM, vol. 31, no. 9, pp. 11161127, 1988.
[2] S. Albers, “On the Influence of Lookahead in Competitive Paging Algorithms,” Algorithmica, vol. 18, no. 3, pp. 283305, July 1997.
[3] S. Albers, N. Garg, and S. Leonardi, “Minimizing Stall Time in Single and Parallel Disk Systems,” J. ACM, vol. 47, no. 6, pp. 969986, Nov. 2000.
[4] D. Aksoy and M. Franklin, Rxw: A Scheduling Approach for LargeScale OnDemand Data Broadcast IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 846860, 1999.
[5] L.M. Baptist and T.H. Cormen, “Multidimensional, Multiprocessor, OutofCore FFTs with Distributed Memory and Parallel Disks,” Proc. 11th Ann. ACM Symp. Parallel Algorithms and Architectures, June 1999.
[6] R.D. Barve, E.F. Grove, and J.S. Vitter, “Simple Randomized Mergesort on Parallel Disks,” Parallel Computing, vol. 23, no. 4,pp. 601–631, 1997.
[7] R.D. Barve, M. Kallahalla, P.J. Varman, and J.S. Vitter, “Competitive Parallel Disk Prefetching and Buffer Management,” J. Algorithms, vol. 36, no. 2, pp. 152181, Aug. 2000.
[8] L.A. Belady, “A Study of Replacement Algorithms for a Virtual Storage Computer,” IBM Systems J., vol. 5, no. 2, pp. 78101, 1966.
[9] D. Breslauer, “On Competitive Online Paging with Lookahead,” Proc. 23rd Symp. Theoretical Aspects of Computer Science, pp. 593–603, 1996.
[10] P. Cao, E. Felten, A. Karlin, and K. Li, “A Study of Integrated Prefetching and Caching Strategies,” Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, pp. 188–197, 1995.
[11] F. Chang and G. Gibson, "Automatic I/O Hint Generation Through Speculative Execution," Proc. 3rd Symp. Operating System Design and Implementation,Usenix, Berkeley, Calif., 1999, pp. 114.
[12] T.H. Cormen and M. Hirschl, “Early Experiences in Evaluating the Parallel Disk Model with the ViC* Implementation,” Parallel Computing, vol. 23, nos. 45, pp. 571600, June 1997.
[13] O. Ertug, M. Kallahalla, and P. Varman, “RealTime Parallel Disk Scheduling for VBR Video Servers,” Proc. Fifth Int'l Conf. Computer Science and Informatics, Feb. 2000.
[14] A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, and N.E. Yong, "Competitive Paging Algorithms," J. Algorithms, vol. 12, pp. 685699, 1991
[15] M. Kallahalla and P.J. Varman, Optimal ReadOnce Parallel Disk Scheduling Proc. Workshop on I/O in Parallel and Distributed Systems (IOPADS), pp. 6877, 1999.
[16] A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator, “Competitive Snoopy Caching,” Algorithmica, vol. 5, no. 3, pp. 79119, Mar. 1988.
[17] T. Kimbrel and A.R. Karlin, “NearOptimal Parallel Prefetching and Caching,” SIAM J. Computing, vol. 29, no. 4, pp. 10511082, 2000.
[18] D.F. Kotz and C.S. Ellis, “Prefetching in File Systems for MIMD Multiprocessors,” IEEE Trans. Parallel and Distributed Computing, vol. 1, no. 2,pp. 218–230, 1990.
[19] L.A. McGeoch and D.D. Sleator, “A Strongly Competitive Randomized Paging Algorithm,” Algorithmica, vol. 6, pp. 816825, 1991.
[20] P. Sanders, S. Egner, and J. Korst, Fast Concurrent Access to Parallel Disks Proc. 11th ACMSIAM Symp. Discrete Algorithms, pp. 849858, 2000.
[21] V.S. Pai, A.A. Schäffer, and P.J. Varman, “Markov Analysis of MultipleDisk Prefetching Strategies for External Merging,” Theoretical Computer Science, vol. 12,pp. 211–239, 1994.
[22] R.H. Patterson, G. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka, "Informed Prefetching and Caching," Proc. 15th ACM Symp. Operating Systems Principles, pp. 7995, Dec. 1995.
[23] D. Sleator and R. Tarjan, “Amortized Efficiency of List Update and Paging Rules,” Comm. ACM, vol. 28, no. 2, pp. 202–208, 1985.
[24] P.J. Varman and R.M. Verma, “Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems,” IEEE Trans. Parallel and Distributed Systems, pp. 12621275, Dec. 1999.
[25] J.S. Vitter and E.A.M. Shriver, “Optimal Algorithms for Parallel Memory I: TwoLevel Memories,” Algorithmica, vol. 12, nos. 23, pp. 110147, 1994.