Balancing Load versus Decreasing Communication: Parameterizing the Tradeoff

Journal of Parallel and Distributed Computing

Volumn 61, Issue 5, 2001, Pages 567-580

  Taylor, Valerie E ^a   Schwabe, Eric J ^b   Holmer, Bruce K ^c   Hribar, Michelle R ^d  

^a NORTHWESTERN UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

^c TeraLogic Inc   (United States)

^d PACIFIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038439331     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2001.1701     Document Type: Article

References (24)

1. Barnard S. T., Simon H. D. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice Exp. 6:1994;101-117.
2. Belytschko T., Chiapetta R. L. Technical Report. 1973.
3. Belytschko T., Chiapetta R. L., Bartet H. Efficient large nonlinear transient analysis by finite elements. Internat. J. Numer. Methods Engrg. 10:1976;579-596.
4. Belytschko T. Finite element analysis on the connection machine. Comput. Methods Appl. Mech. Engrg. 81:1990;229-254.
5. Berger M., Bokhari S. A partitioning strategy for non-uniform problems on multiprocessors. IEEE Trans. Comput. 36:1987;5.
6. Chen Hsin-Chu, Gao Hui, Sarma Sanjay. Technical Report. 1991.
7. Hendrickson B., Leland R. Technical Report. 1993.
8. Farhat C. On the mapping of massively parallel processors onto finite element graphs. Comput. & Structures. 32:1989;347-353.
9. Fox G. C., Williams R. D., Messina P. C. Parallel Computing Works! 1986;Kaufmann, Los Altos.
10. Hennessy J., Patterson D. Computer Architecture: A Quantitative Approach. 1996;Kaufmann, San Francisco.
11. Foster I. T. Designing and Building Parallel Programs. 1995;Addison-Wesley, Menlo Park.
12. Johnson D. S., Aragon C. R., McGeoch L. A., Schevon C. Optimization by simulated annealing: An experimental evaluation. Part I. Graph partitioning. Oper. Res. 37:November-December 1989;865-892.
13. Karypis G., Kumar V. Technical report. 1995.
14. Kirkpatrick S., Gelatt C., Vecchi M. Optimization by simulated annealing. Science. 220:1983;671.
15. Kernighan B., Lin L. An effective heuristic procedure for partitioning graphs. Bell Systems Tech. J. 49:1970.
16. O. C. Martin, and, S. W. Otto, Partitioning of unstructured meshes for load balancing, Concurrency: Practice Exp, in press.
17. Martin O. C., Otto S. W., Felten E. W. Large-step markov chains for the traveling salesman problem. J. Complex Systems. 5:1991;3.
18. Metropolis. J. Chem. Phys. 21:1953;1087.
19. Nour-Omid B., Raefsky A., Lyzenga G. Solving finite element equations on concurrent computers. Noor A. K. Parallel Computations and Their Impact on Mechanics. 1986;209-227 ASME, New York.
20. Simon H. D. Partitioning of unstructured problems for parallel processing. Comput. Systems Engrg. 2:1991;135-148.
21. Schopf J. M., Berman F. Performance prediction in production environments. Proceedings of IPPS/SPDP. 1998.
22. V. E. Taylor, J. Chen, T. Canfield, and, R. Stevens, A decomposition method for efficient use of distributed supercomputers for finite element applications, in, Proceedings of the International Conference on Applications-Specific Systems, Architectures and Processors, August 18-21, 1996.
23. Vanderstraeten D., Farhat C., Chen P. S., Keunings R., Zone O. Technical Report. 1994.
24. Willebeek-LeMair M., Reeves A. Strategies for dynamic load balancing on highly parallel computers. IEEE Trans. Parallel Distributed Systems. 4:1993;979-993.