Heuristics for scheduling I/O operations

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 3, 1997, Pages 310-320

  Jain, Ravi ^a,d   Somalwar, Kiran ^b   Werth, John ^c,d   Browne, J C ^c,d  

^a TELCORDIA TECHNOLOGIES   (United States)

^b HEWLETT PACKARD COMPANY   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d IEEE   (United States)

Author keywords

Data transfer scheduling; Graph edge coloring; I O bottleneck; Multiprocessor operating systems; Parallel I O; Scheduling heuristics; Simultaneous resource scheduling

Indexed keywords

ALGORITHMS; COMPUTER OPERATING PROCEDURES; DATA TRANSFER; HEURISTIC METHODS; INPUT OUTPUT PROGRAMS; RESOURCE ALLOCATION;

PARALLEL INPUT/OUTPUT OPERATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 0031099541     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.584096     Document Type: Article

References (39)

1. J. Akella and D.P. Siewiorek, "Modeling and Measurement of the Impact of Input/Output on System Performance," Proc. 18th Int'l Symp. Computer Architecture, pp. 390-399, 1991.
2. M. Arrott and S. Latta, "Perspectives on Visualization," IEEE Spectrum, pp. 61-65, Sept. 1992.
3. A. Bar-Noy, R. Motwani, and J. Naor, "The Greedy Algorithm Is Optimal for On-Line Edge Coloring," Information Processing Letters, pp. 251-253, Dec. 1992.
4. C. Berge, Graphs. North-Holland, 1985.
5. G. Bongiovanni, D. Coppersmith, and C.K. Wong, "An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders," IEEE Trans. Comm., vol. 29, no. 5, pp. 721-726, May 1981.
6. H. Boral and D.J. DeWitt, "Database Machines: An Idea Whose Time Has Passed? A Critique of the Future of Database Machines, " Proc. Third Int'l Workshop Database Machines, pp. 166-187, 1983.
7. Database Machines, H. Boral and P. Faudemay, eds. Springer-Verlag, 1989.
8. C.E. Catlett, "Balancing Resources," IEEE Spectrum, pp. 48-55, Sept. 1992.
9. T. Cormen, "Fast Permuting in Disk Arrays," J. Parallel and Distributed Computing, pp. 41-57, Jan./Feb. 1993.
10. J.M. del Rosario and A. Choudhary, "High-Performance I/O for Massively Parallel Computers: Problems and Prospects," Computer, pp. 59-68, Mar. 1994.
11. P.J. Denning, "Effects of Scheduling on File Memory Operations," Proc. AFIPS Spring Joint Computer Conf., pp. 9-21, 1967.
12. W. Feller, An Introduction to Probability Theory and Its Applications. John Wiley, 1966.
13. CACM Special Issue on Digital Multimedia Systems, E.A. Fox, ed. ACM, Apr. 1991.
14. S. Ghandeharizadeh and L. Ramos, "Real-Time Display of Multimedia Data Using a Shared-Nothing Architecture," Computer Architecture News, Dec. 1993.
15. G.A. Gibson, Redundant Disk Arrays: Reliable, Parallel Secondary Storage. MIT Press, 1992.
16. R. Haskin, "The Shark Continuous-Media File Server," Proc. Compcon Spring '93, p. 12, 1993.
17. D.S. Hochbaum, T. Nishizeki, and D.B. Shmoys, "A Better Than 'Best Possible' Algorithm to Edge Color Multigraphs," SIAM J. Computing, vol. 7, pp. 79-104, 1986.
18. R. Jain, "Scheduling Data Transfers in Parallel Computers and Communications Systems," Technical Report TR-93-03, Univ. of Texas at Austin, Dept. of Computer Science, Feb. 1993.
19. R. Jain, K. Somalwar, J. Werth, and J.C. Browne, "Scheduling Parallel I/O Operations in Multiple-Bus Systems," J. Parallel and Distributed Computing, special issue on Scheduling and Load Balancing, Dec. 1992.
20. R. Jain, K. Somalwar, J. Werth, and J.C. Browne, "Scheduling Parallel I/O Operations," Proc. Workshop I/O in Parallel Computing Systems, Apr. 1993.
21. R. Jain, J. Werth, and J.C. Browne, "A General Model for Scheduling of Parallel Computations and Its Application to parallel I/O Operations," Proc. Int'l Conf. Parallel Processing, 1991.
22. D. Kotz, "Multiprocessor File System Interfaces," Proc. Second Int'l Conf. Parallel and Distributed Information Systems, pp. 194-201, 1993.
23. P. L'Eculyer, "Efficient and Portable Combined Random Number Generators," Comm. ACM, vol. 31, pp. 742-774, June 1988.
24. Z. Lin and S. Zhou, "Parallelizing I/O Intensive Applications for a Workstation Cluster: A Case Study," Computer Architecture News, Dec. 1993.
25. T. Lovett and S. Thakkar, "The Symmetry Multiprocessor System," Proc. Int'l Conf. Parallel Processing, pp. 303-310, 1988.
26. E. Miller, "Input/Output Behavior of Supercomputing Applications," Technical Report UCB/CSD 91/616, Univ. of California, Berkeley, 1991.
27. T.N. Mudge, J.P. Hayes, and D.C. Winsor, "Multiple Bus Architectures," Computer, vol. 20, no. 6, pp. 42-48, June 1987.
28. J. Pasquale, "Systems Software and Hardware Support Considerations for Digital Video and Audio Computing," Proc. 26th Hawaii Int'l Conf. Systems Science, p. 15, 1993.
29. D.A. Patterson, G.A. Gibson, and R.H. Katz, "A Case for Redundant Arrays of Inexpensive Disks (RAID)," Proc. SIGMOD, 1988.
30. G. Pfister, W.C. Brantley, D.A. George, S.L. Harvey, W.J. Kleinfelder, K.P. McAuliffe, E.A. Melton, V.A. Norton, and J. Weiss, "The IBM Research Parallel Processor (RPS): Introduction and Architecture," Proc. Int'l Conf. Parallel Processing, pp. 764-771, 1985.
31. P.V. Rangan, H.M. Vin, and S. Ramanathan, "Designing a Multi-User Multimedia On-Demand Service," Technical Report CS92-231, Univ. of California, San Diego, 1992.
32. A.L.N. Reddy, P. Banerjee, and D.K. Chen, "Compiler Support for Parallel I/O Operations," Technical Report RJ 7918 (#72901), IBM Almaden Research Center, 1991.
33. A. Silberschatz and J. Peterson, Operating Systems Concepts. Addison-Wesley, 1988.
34. J.E. Smith, W.C. Hsu, and C. Hsuing, "Future General Purpose Supercomputer Architectures," Proc. Supercomputing '90, pp. 796-804, 1990.
35. K. Somalwar, "Data Transfer Scheduling," Technical Report TR-88-31, Univ. of Texas at Austin, Dept. of Computer Science, 1988.
36. J.S. Vitter and M.H. Nodine, "Large-Scale Sorting in Uniform Memory Hierarchies," J. Parallel and Distributed Computing, pp. 107-114, Jan./Feb. 1993.
37. D. Durand, R. Jain, and D. Tseyklin, "Applying Randomized Edge Coloring Algorithms to Distributed Communication: An Experimental Study," Proc. Symp. Parallel Algorithms and Architecture (CPAA), July 1995.
38. R. Jain and J. Werth, "Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs," Information Processing Letters, vol. 54, pp. 163-168, 1995.
39. R. Jain, J. Werth, and J.C. Browne, "I/O in Parallel and Distributed Systems: An Introduction," Input/Output in Parallel and Distributed Computer Systems, R. Jain, J. Werth, and J.C. Browne, eds., p. 416. Norwell, Mass.: Kluwer Academic, 1996.