Optimal clustering of tree-sweep computations for high-latency parallel environments

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 8, 1999, Pages 813-824

  Gao, Lixin ^a,b   Rosenberg, Arnold L ^a,c   Sitaraman, Ramesh K ^a,c  

^a IEEE

^b SMITH COLLEGE   (United States)

^c Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; COMPUTER WORKSTATIONS; TREES (MATHEMATICS);

NETWORKS OF WORKSTATIONS (NOW); OPTIMAL CLUSTERING; TREE-SWEEP COMPUTATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0033171267     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.790599     Document Type: Article

References (33)

1. F. Afrati personal communication, 1996.
2. A. Alexandrov, M.I. Ionescu, K.E. Schauser, and C. Scheiman, "LoGP: Incorporating Long Messages into the LogP Model - One Step Closer Towards a Realistic Model for Parallel Computation," Seventh ACM Symp. Parallel Algorithms and Architectures, pp. 95-105, 1995.
3. G. Bilardi, K.T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis, "BSP vs. LogP," Eighth ACM Symp. Parallel Algorithms and Architectures, pp. 25-32, 1996.
4. R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, vol. 21, pp. 201-206, 1974.
5. P. Chretienne, "A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System under Tree-Like Precedence Constraints," European J. Operations Research, vol. 43, pp. 225-230, 1989.
6. P. Chretienne and C. Picouleau, "A Basic Scheduling Problem with Interprocessor Communication Delays," Proc. Summer School on Scheduling Theory and Its Applications, pp. 81-100, 1992.
7. P. Chrétienne and C. Picouleau, "Scheduling with Communication Delays: A Survey," Scheduling Theory and Its Applications, P. Chrétienne, E.G. Coffman, J.K. Lenstra, and Z. Liu, eds. pp. 65-90. New York: John Wiley & Sons, 1995.
8. D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, "LogP: Towards a Realistic Model of Parallel Computation," Comm. ACM, 1996.
9. M. Fujii, T. Kasami, and K. Ninomiya, "Optimal Sequencing of Two Equivalent Processors," SIAM J. Applied Math., vol. 17, pp. 784-789, 1969.
10. L.-X. Gao and A.L. Rosenberg, "Toward Efficient Scheduling of Evolving Computations on Rings of Processors," J. Parallel and Distributed Computing, vol. 38, pp. 92-100, 1996.
11. M.R. Garey and D.S. Johnson, Computers and Intractability. San Francisco: W.H. Freeman, 1979.
12. A. Gerasoulis, S. Venugopal, and T. Yang, "Clustering Task Graphs for Message Passing Architectures," Proc. ACM Int'l Conf. Supercomputing, pp. 447-456, 1990.
13. A. Gerasoulis and T. Yang, "A Comparison of Clustering Heuristics for Scheduling Dags on Multiprocessors," J. Parallel and Distributed Computing, vol. 16, pp. 276-291, 1992.
14. R.L. Graham, "Bounds for Certain Multiprocessor Timing Anomalies," Bell Systems Technology J., vol. 45, pp. 1,563-1,581, 1966.
15. A. Jakoby and R. Reischuk, "The Complexity of Scheduling Problems with Communication Delays for Trees," Proc. Scandinavian Workkshop Algorithmic Theory, pp. 163-177, 1992.
16. H. Jung, L. Kirousis, and P. Spirakis, "Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays," Information Computing, vol. 105, pp. 94-104, 1993.
17. C. Kaklamanis and G. Persiano, "Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors," Math. Systems Theory, vol. 27, pp. 471-489, 1994.
18. R.M. Karp, A. Sahay, E. Santos, and K.E. Schauser, "Optimal Broadcast and Summation in the LogP Model," Proc. Fifth ACM Symp. Parallel Algorithms and Architectures, pp. 142-153, 1993.
19. R.M. Karp and Y. Zhang, "Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation," J. ACM, vol. 40, pp. 765-789, 1993.
20. J.-S. Kim, S. Ha, and C.S. Jhon, "Efficient Barrier Synchronization Mechanism for the BSP Model on Message-Passing Architectures," Proc. 12th IEEE Int'l Parallel Processing Symp., pp. 255-259, 1998.
21. S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computations upon Multiprocessor Architectures," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 1-8, 1988.
22. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, "Sequencing and Scheduling: Algorithms and Complexity," Handbooks of Operations Research and Management Science, S.C. Graves and A.H.G. Rinnooy Kan, eds. Amsterdam: Elseviers, vol. 4, pp. 445-522 1993.
23. J.K. Lenstra, M. Veldhorst, and B. Veltman, "The Complexity of Scheduling Trees with Communication Delays," J. Algorithms, vol. 20, pp. 157-173, 1996.
24. C.H. Papadimitriou and M. Yannakakis, "Towards an Architecture-independent Analysis of Parallel Algorithms," SIAM J. Computing, vol. 19, pp. 322-328, 1990.
25. G.F. Pfister, In Search of Clusters. Upper Saddle River, N.J.: Prentice Hall, 1995.
26. A.G. Ranade, "Optimal Speedup for Backtrack Search on a Butterfly Network," Math. Systems Theory, vol. 27, pp. 85-101, 1994.
27. V.J. Rayward-Smith, "UET Scheduling with Unit Interprocessor Communication Delays," Discrete Applied Math., vol. 18, pp. 55-71, 1987.
28. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. Cambridge, Mass.: MIT Press, 1989.
29. H.K. Tadepalli and E.L. Lloyd, "An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays," 10th Int'l Parallel Processing Symp., pp. 584-590, 1996.
30. J.D. Ullman, "NP-Complete Scheduling Problems," J. Comput. Syst. Scis., //please spell out journal name// vol. 10, pp. 384-393, 1975.
31. L.G. Valiant, "A Bridging Model for Parallel Computation," Comm. ACM, vol. 33, pp. 103-111, 1990.
32. M.-Y. Wu and D. Gajski, "A Programming Aid for Hypercube Architectures," J. Supercomputing, vol. 2, pp. 349-372, 1988.
33. T. Yang and A. Gerasoulis, "A Fast Static Scheduling Algorithm for Dags on an Unbounded Number of Processors," Proc. Supercomputing '91, pp. 633-642, 1991.