Abstract
The cost of data transfers, and in particular of I/O operations, is a growing problem in parallel computing. This performance bottleneck is especially severe for data-intensive applications such as multimedia information systems, databases, and Grand Challenge problems. A promising approach to alleviating this bottleneck is to schedule parallel I/O operations explicitly.
Although centralized algorithms for batch scheduling of parallel I/O operations have previously been developed, they are not be appropriate for all applications and architectures. We develop a class of decentralized algorithms for scheduling parallel I/O operations, where the objective is to reduce the time required to complete a given set of transfers. These algorithms, based on edge-coloring and matching of bipartite graphs, rely upon simple heuristics to obtain shorter schedules. We present simulation results indicating that the best of our algorithms can produce schedules whose length (or makespan) is within 2–20% of the optimal schedule, a substantial improvement on previous decentralized algorithms. We discuss theoretical and experimental work in progress and possible extensions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, pages 1116–1127, Sep. 1988.
T. E. Anderson, S.S. Owicki, J. B. Saxe, and C. P. Thacker. High-Speed Switch Scheduling for Local-Area Networks. ACM Transactions on Computer Systems, 11 (4): 319–352, November 1993.
M. Beeler. Inside the TC2000 Computer, First Rel. BBN Advanced Computers Inc., 1990.
Claude Berge. Graphs. North Holland, 1985.
L. Bianco, J. Blazewicz, P. Dell’Olmo, Dell’Olmo P, and M. Drozdowski. Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Technical Report R-92/045, Institute of Computing Science, TU Poznan, 1992.
L. Bianco, J. Blazewicz, P. Dell’Olmo P, and M. Drozdowski. Scheduling preemptive multiprocessor tasks on dedicated processors. Perf. Eval., 1994. To appear.
E. G. Coffman, Jr., editor. Computer and Job-Shop Scheduling Theory. John Wiley, 1976.
E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and A. S. LaPaugh. Scheduling file transfers. SIAM Journal of Computing, 3:744–780,1985.
P. F. Corbett, S. J. Baylor, and D. G. Feitelson. Overview of the Vesta Parallel File System. In The 1993 Workshop on Input/Output in Parallel Computer Systems, pages 1–17,1993.
Thomas H. Corman. Fast Permuting on Disk Arrays. Journal of Parallel and Distributed Computing, 17:41–57, January 1993.
T. H. Cormen and D. Kotz. Integrating Theory and Practise in Parallel File Systems. In Proceedings of the DAGS 93 Symposium on Parallel I/O and Databases, pages 64–74,1993.
Juan Miguel del Rosario, Rajesh Bordawekar, and Alok Choudhary. Improved Parallel I/O via a Two-phase Run-time Access Strategy. In The 1993 Workshop on Inputl Output in Parallel Computer Systems, pages 56–70,1993.
P. J. Denning. Effects of scheduling on file memory operations. In Proc. AFIPS Spring Joint Comp. Conf., pages 9–21,1967.
M.D. Durand, T. Montaut, L. Kervella, and W. Jalby. Impact of Memory Contention on Dynamic Scheduling on NUMA Multiprocessors. In Proceedings of the 1993 International Conference on Parallel Processing, August 1993.
Gereb-Graus and Tsantilas. Efficient Optical Communication in Parallel Computers. In 1992 Symposium on Parallel Algorithms and Architectures, pages 41–48,1992.
Mario Gonzalez, Jr. Deterministic Processor Scheduling. Computing Surveys, 9:173, Sept. 1977.
R. Jain, K. Somalwar, J. Werth, and J.C. Browne. Scheduling Parallel I/O Operations in Multiple Bus Systems. Journal of Parallel and Distributed Computing, 16:352–362, December 1992.
R. Jain, K. Somalwar, J. Werth, and J.C. Browne. Heuristics for Scheduling Parallel I/O Operations. IEEE Trans. Par. and Distrib. Sys., to appear, 1996.
Ravi Jain. Scheduling data transfers in parallel computers and communications systems. Technical Report TR-93–03, Univ. Texas at Austin, Dept. of Comp. Sci., Feb. 1993.
H. J. Karloff and D. B. Schmoys. Efficient Parallel Algorithms for Edge Coloring Problems. Journal of Algorithms, pages 39 -52, August 1987.
D. Kotz. Multiprocessor file system interfaces. In Proc. 2nd Intl. Conf. Par. Distrib. Info. Sys., pages 194–201,1993.
O. Kreiger and M. Stumm. HFS: A Flexible File System for large-scale Multiprocessors. In Proceedings of the DAGS 93 Symposium on Parallel I/O and Databases, pages 6–14,1993.
E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Recent developments in deterministic sequencing and scheduling: A survey. In Deterministic and Stochastic Scheduling, pages 35–73. D. Reidel Publishing, 1982.
M. Luby. Removing Randomness in Parallel Computation without a Processor Penalty. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 162–173,1988.
M. Nodine and J. S. Vitter. Paradigms for optimal sorting with multiple disks. In Proc. 26th Hawaii Intl. Conf Sys. Sci., page 50, 1993.
Krishna Palem. On the Complexity of Precedence Constrained Scheduling. PhD thesis, Univ. Texas at Austin, Dept. of Comp. Sci., 1986. Available as Tech. Rept. TR-86–11.
A. Panconesi and A Srinavasan. Fast Randomized Algorithms for Distributed Edge Coloring. In Proceedings of the 1992 ACM Symposium on Parallel and Distributed Computing, pages 251–262, August 1992.
David Patterson, Garth Gibson, and Randy Katz. A case for redundant arrays of inexpensive disks (RAID). In ACM SIGMOD Conference, pages 109–116, June 1988.
R. H. Patterson, G. A. Gibson, and M. Satyanarayanan. Informed Prefetching: Converting High Throughput to Low Latency. In Proceedings of the DAGS 93 Symposium on Parallel I/O and Databases, pages 41–55,1993.
A. Silberschatz and J. Peterson. Operating systems concepts. Addison-Wesley, 1988.
M. Stonebraker and G. A. Schloss. Distributed RAID — a new multiple copy algorithm. In Proc. 6th Intl. Conf. Data Eng., pages 430–437,1990.
J.S. Vitter and M.H. Nodine. Large-scale sorting in uniform memory hierarchies. Journal of Parallel and Distributed Computing, pages 107–4114,Jan./Feb.1993.
J.S. Vitter and E. A. M. Shriver.Optimal disk I/O with parallel block transfer.In Proc. ACM Symp. Theory of Comp., 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Durand, D., Jain, R., Tseytlin, D. (1996). Improving the Performance of Parallel I/O Using Distributed Scheduling Algorithms. In: Jain, R., Werth, J., Browne, J.C. (eds) Input/Output in Parallel and Distributed Computer Systems. The Kluwer International Series in Engineering and Computer Science, vol 362. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1401-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1401-1_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8607-3
Online ISBN: 978-1-4613-1401-1
eBook Packages: Springer Book Archive