Enhancing data locality by using terminal propagation
- Sandia National Labs., Albuquerque, NM (United States)
- Katholieke Univ. Leuven (Belgium). Dept. Computer Sciences
Terminal propagation is a method developed in the circuit placement community for adding constraints to graph partitioning problems. This paper adapts and expands this idea, and applies it to the problem of partitioning data structures among the processors of a parallel computer. We show how the constraints in terminal propagation can be used to encourage partitions in which messages are communicated only between architecturally near processors. We then show how these constraints can be handled in two important partitioning algorithms, spectral bisection and multilevel-KL. We compare the quality of partitions generated by these algorithms to each other and to Partitions generated by more familiar techniques.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000; AC04-76DP00789
- OSTI ID:
- 172137
- Report Number(s):
- SAND--95-2372C; CONF-960116--3; ON: DE96002081
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multidimensional spectral load balancing
Multidimensional spectral load balancing