Automatic selection of load balancing parameters using compile-time and run-time information

Concurrency Practice and Experience

Volumn 9, Issue 4, 1997, Pages 275-317

  Siegell, B S ^a   Steenkiste, P A ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PARAMETER ESTIMATION; PROGRAM COMPILERS;

DYNAMIC LOAD BALANCING; NECTAR SYSTEM; RUN TIME INFORMATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031124364     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(199704)9:4<275::AID-CPE251>3.0.CO;2-Y     Document Type: Article

References (44)

1. V. S. Sunderam, 'PVM: A framework for parallel distributed computing', Concurrency, Pract. Exp. 2, (4), 315-339 (1990).
2. Message Passing Interface Forum, MPI: A Message-Passing Interface Standard, Technical report, University of Tennessee, Knoxville, TN, May 1994.
3. Bruce S. Siegell, Automatic Generation of Parallel Programs with Dynamic Load Balancing for a Network of Workstations, PhD thesis, Department of Electrical and Computer Engineering, Carnegie Mellon University, 5 May 1995.
4. Bruce S. Siegell and Peter Steenkiste, 'Automatic generation of parallel programs with dynamic load balancing', Proceedings of the Third IEEE Symposium on High Performance Distributed Computing, San Francisco, CA, 2-5 August 1994, IEEE Computer Society Press, pp. 166-175.
5. Nenad Nedelijković and Michael J. Quinn, 'Data-parallel programming on a network of heterogeneous workstations', Proc. of the First Int'l Symposium on High-Performance Distribution Computing, IEEE Computer Society Press, September 1992, pp. 28-36.
6. Hiroshi Nishikawa and Peter Steenkiste, 'Aroma: Language support for distributed objects', Proc. of the Sixth Int'l Parallel Processing Symposium, IEEE Computer Society Press, March 1992, pp. 686-690.
7. David A. Padua and Michael J. Wolfe, 'Advanced compiler optimizations for supercomputers', Commun. ACM, 29, (12), 1184-1201 (1986).
8. Pieter Struik, 'Techniques for designing efficient parallel programs', in Wouter Joosen and Elie Milgrom (Eds.), Parallel Computing: From Theory to Sound Practice, IOS Press, 1992, pp. 208-211.
9. Peiyi Tang and John N. Zigman, 'Reducing data communication overhead for DOACROSS loop nests', 1994 International Conference on Supercomputing Conference Proceedings, ACM SIGARCH, ACM Press, July 1994, pp. 44-53.
10. Bruce S. Siegell and Peter Steenkiste, 'Controlling application grain size on a network of workstations, Supercomputing '95, San Diego, CA, December 1995, IEEE Computer Society Press.
11. David B. Loveman, 'Program improvement by source-to-source transformation', J. Assoc. Comput. Mach., 24, (1), 121-145 (1977).
12. John R. Allen and Ken Kennedy. Automatic loop interchange, Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, Montreal, Canada, 17-22 June 1984, pp. 233-246, ACM Special Interest Group on Programming Languages.
13. Michael Wolfe, 'Vector optimizations vs. vectorization', J. Parallel Distrib. Comput., 5, 551-567.
14. Michael Wolfe, 'Massive parallelism through program restructuring', in Joseph Jaja (Ed.), The 3rd Symposium on the Frontiers of Massively Parallel Computation, University of Maryland, College Park, MD, 8-10 October 1990, IEEE Computer Society Press, pp. 407-415.
15. Michael Wolfe, 'Loop skewing: The wavefront method revisited', Int. J. Parallel Program., 15, (4), 279-293.
16. David Callahan and Ken Kennedy, 'Compiling programs for distributed-memory multiprocessors', J. Supercomput., 2, (2), 151-169 (1988).
17. Seema Hiranandani, Ken Kennedy, and Chau-Wen Tseng, 'Compiling Fortran D for MIMD distributed-memory machines', Commun. ACM, 35, (8), 66-80 (1992).
18. Seema Hiranandani, Ken Kennedy, and Chau-Wen Tseng, 'Evaluation of compiler optimizations for Fortran D on MIMD distributed-memory machines', in Proceedings of the 1992 International Conference on Supercomputing, Washington, DC, 19-23 July 1992, pp. 1-14.
19. Michael E. Wolf and Monica S. Lam, 'A loop transformation theory and an algorithm to maximize parallelism', IEEE Trans. Parallel Distrib. Syst., 2, (4), 452-471.
20. Michael Wolfe, 'More iteration space tiling', Technical Report CS/E 89-003, Oregon Graduate Center, Department of Computer Science and Engineering, 19600 N. W. von Neumann Drive, Beaverton, OR 97006-1999 USA, 1989.
21. Samuel J. Leffler, Marshall Kirk McKusick, Michael J. Karels, and John S. Quarterman, The Design and Implementation of the 4.3BSD UNIX Operating System, Addison-Wesley Series in Computer Science, Addison-Wesley Publishing Company, Inc., Reading, Massachusetts, 1989.
22. Computer Systems Research Group, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA 94720. UNIX Programmer's Reference Manual (PRM), 4.3 berkeley software distribution edition, April 1986.
23. Michael Wolfe, 'Vector optimization vs. vectorization', J. Parallel Distrib. Comput., 5, 551-567 (1988).
24. Emmanuel Arnould, Francois Bitz, Eric Cooper, H. T. Kung, Robert Sansom, and Peter Steenkiste, 'The design of Nectar: A network backplane for heterogeneous multicomputers', ASPLOS-III Proceedings, ACM/IEEE, April 1989, pp. 205-216.
25. Yung-Terng Wang and Robert J. T. Morris, 'Load sharing in distributed systems', IEEE Trans. Comput., C-34, (3), 204-217.
26. Thomas L. Casavant and Jon G. Kuhl, 'A taxonomy of scheduling in general-purpose distributed computing systems', IEEE Trans. Softw. Eng., 14, (2), 141-154 (1988).
27. Constantine D. Polychronopoulos, 'Toward auto-scheduling compilers', J. Supercomput., 2, (3), 297-330 (1988).
28. Constantine D. Polychronopoulos and David J. Kuck, 'Guided self-scheduling: A practical scheduling scheme for parallel supercomputers', IEEE Trans. Comput., C-36, (12), 1425-1439 (1987).
29. Susan Flynn Hummel, Edith Schonberg, and Lawrence E. Flynn, 'Factoring: A practical and robust method for scheduling parallel loops', Supercomputing '91 Proceedings, Albuquerque, NM, 18-22 November 1991, IEEE Computer Society Press, pp. 610-619.
30. Ten H. Tzen and Lionel M. Ni, 'Trapezoid self-scheduling: A practical scheduling scheme for parallel compilers', IEEE Trans. Parallel Distrib. Syst.,4, (1), 87-98 (1993).
31. Evangelos P. Markatos and Thomas J. LeBlanc, 'Using processor affinity in loop scheduling on shared-memory multiprocessors', Proceedings of Supercomputing '92, Minneapolis, MN, 16-20 November 1992, IEEE Computer Society Press, pp. 104-113.
32. Hui Li, Sudarsan Tandri, Michael Stumm, and Kenneth C. Sevcik, 'Locality and loop scheduling on NUMA multiprocessors', Proceedings of the 1993 International Conference on Parallel Processing, CRC press, Inc., August 1993, pp. 11-140-11-147.
33. Larry Rudolph, Miriam Slivkin-Allalouf, and Eli Upfal, 'A simple load balancing scheme for task allocation in parallel machines', SPAA '91. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, Hilton Head, SC, 21-24 July 1991, ACM Press, pp. 237-245.
34. I-Chen Wu, Multilist scheduling: A New Parallel Programming Model, PhD thesis, School of Computer Science, Carnegie Mellon University, 1993; also appeared as technical report CMU-CS-93-184.
35. I-Chen Wu, Multilist scheduling: A New Parallel Programming Model, PhD thesis, School of Computer Science, Carnegie Mellon University, 1993; also appeared as technical report CMU-CS-93-184.
36. Frank C. H. Lin and Robert M. Keller, 'The gradient model load balancing method', IEEE Trans. Softw. Eng., SE13, (1), 32-38 (1987).
37. Hiroshi Nishikawa and Peter Steenkiste, 'A general architecture for load balancing in a distributed-memory environment', Proceedings of the 13th International Conference on Distributed Computing Systems, Pittsburgh, PA, May 1993, IEEE, IEEE Computer Society Press, pp. 47-54.
38. Steven Lucco, 'A dynamic scheduling method for irregular parallel programs', Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, San Francisco, CA, June 1992, ACM Press, pp. 200-211.
39. John A. Stankovic, 'Stability and distributed scheduling algorithms', IEEE Trans. Softw. Eng., SE-11, (10), 1141 (1985).
40. Thomas L. Casavant and John G. Kuhl, 'Effects of response and stability on scheduling in distributed computing systems', IEEE Trans. Softw. Eng., 14, (11), 1578-1588 (1988).
41. KumarK. Goswami, Murthy Devarakonda, and Ravishankar K. Iyer, 'Prediction-based dynamic load-sharing heuristics', IEEE Trans. Parallel Distrib. Syst. 4, (6), 638-648 (1993).
42. David M. Nicol and Joel H. Saltz, 'Dynamic remapping of parallel computations with varying resource demands', IEEE Trans. Comput., 37, (9), 1073-1087 (1988).
43. S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C.-W. Tseng, 'An overview of the Fortran D programming system', in U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (Eds.), Languages and Compilers for Parallel Computing. Fourth International Workshop, Santa Clara, CA, 7-9 August 1991, Springer-Verlag, pp. 18-34.
44. Gad Aharoni, Dror G. Feitelson, and Ammon Barak, 'A run-time algorithm for managing the granularity of parallel functional programs', J. Funct. Program., 2, (4), 387-405.