Dynamic remapping of parallel computations with varying resource demands
Abstract
A large class of computational problems are characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem is solved on a message passing multiprocessor machine, the combination of these characteristics leads to system performance which deteriorates in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. The authors study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits, and should be general enough to apply automatically to a wide range of computations. The authors propose a general remapping decision heuristic, then study its effectiveness and its anticipated behavior on two very different models of load evolution. Assuming only that the remapping cost is know, this policy dynamically attempts to minimize system degradation including the cost of remapping) per computation step. This policy is quite simple, choosing to remap when the first local minimum in the degradation function is detected.
- Authors:
- Publication Date:
- Research Org.:
- Dept. of Computer Science, College of William and Mary, Williamsburg, VA (US)
- OSTI Identifier:
- 6201257
- Resource Type:
- Journal Article
- Journal Name:
- IEEE Trans. Comput.; (United States)
- Additional Journal Information:
- Journal Volume: 37:9
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; MAPPING; ALGORITHMS; COMPUTERIZED SIMULATION; MATHEMATICAL LOGIC; PROGRAMMING; SIMULATION; 990210* - Supercomputers- (1987-1989)
Citation Formats
Nicol, D M, and Saltz, J H. Dynamic remapping of parallel computations with varying resource demands. United States: N. p., 1988.
Web. doi:10.1109/12.2258.
Nicol, D M, & Saltz, J H. Dynamic remapping of parallel computations with varying resource demands. United States. https://doi.org/10.1109/12.2258
Nicol, D M, and Saltz, J H. 1988.
"Dynamic remapping of parallel computations with varying resource demands". United States. https://doi.org/10.1109/12.2258.
@article{osti_6201257,
title = {Dynamic remapping of parallel computations with varying resource demands},
author = {Nicol, D M and Saltz, J H},
abstractNote = {A large class of computational problems are characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem is solved on a message passing multiprocessor machine, the combination of these characteristics leads to system performance which deteriorates in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. The authors study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits, and should be general enough to apply automatically to a wide range of computations. The authors propose a general remapping decision heuristic, then study its effectiveness and its anticipated behavior on two very different models of load evolution. Assuming only that the remapping cost is know, this policy dynamically attempts to minimize system degradation including the cost of remapping) per computation step. This policy is quite simple, choosing to remap when the first local minimum in the degradation function is detected.},
doi = {10.1109/12.2258},
url = {https://www.osti.gov/biblio/6201257},
journal = {IEEE Trans. Comput.; (United States)},
number = ,
volume = 37:9,
place = {United States},
year = {Thu Sep 01 00:00:00 EDT 1988},
month = {Thu Sep 01 00:00:00 EDT 1988}
}