Multistage linear-array assignment problem. Final report
Technical Report
·
OSTI ID:6062950
Implementation of certain algorithms on parallel computing architectures can involve partitioning contiguous elements into a fixed number of groups, each of which is to be handled by a single processor. It is desired to find an assignment of elements to processors that minimizes the sum of the maximum workloads experienced at each stage. This problem can be viewed as a multi-objective network optimization problem. Polynomially-bounded algorithms are developed for the case of two stages, whereas the associated decision problem (for an arbitrary number of stages) is shown to be NP-complete. Heuristic procedures are therefore proposed and analyzed for the general problem. Computational experience with one of the exact problems, incorporating certain pruning rules, is presented for a variety of test problems. Empirical results also demonstrate that one of the heuristic procedures is especially effective in practice.
- Research Organization:
- National Aeronautics and Space Administration, Hampton, VA (USA). Inst. for Computer Applications in Science and Engineering
- OSTI ID:
- 6062950
- Report Number(s):
- AD-A-203532/7/XAB; ICASE-88-57
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel approximate algorithms for combinatorially hard problems
Rectilinear partitioning of irregular data parallel computations. Contractor report
Nearest-neighbor mapping of finite element graphs onto processor meshes
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:5180559
Rectilinear partitioning of irregular data parallel computations. Contractor report
Technical Report
·
Mon Jul 01 00:00:00 EDT 1991
·
OSTI ID:6098235
Nearest-neighbor mapping of finite element graphs onto processor meshes
Journal Article
·
Mon Nov 30 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5384821