Loading...
Please wait, while we are loading the content...
Similar Documents
A multistage linear array assignment problem
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Richards, D. S. Kincaid, R. K. Shier, D. R. Nicol, David M. |
| Copyright Year | 1988 |
| Description | The implementation of certain algorithms on parallel processing 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 with one of the exact problems. Empirical results also demonstrate that one of the heuristic procedures is especially effective in practice. |
| File Size | 1475167 |
| Page Count | 32 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19890008046 |
| Archival Resource Key | ark:/13960/t1wd8rn4v |
| Language | English |
| Publisher Date | 1988-11-01 |
| Access Restriction | Open |
| Subject Keyword | Computer Programming And Software Algorithms Heuristic Methods Problem Solving Computer Networks Polynomials Systems Analysis Applications Programs Computers Linear Arrays Architecture Computers Parallel Processing Computers Ntrs Nasa Technical Reports ServerĀ (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |