Optimal task assignment in linear array networks
- 1 July 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (7) , 877-880
- https://doi.org/10.1109/12.256461
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Partitioning problems in parallel, pipeline, and distributed computingIEEE Transactions on Computers, 1988
- Assignment Problems in Parallel and Distributed ComputingPublished by Springer Nature ,1987
- Allocating programs containing branches and loops within a multiple processor systemIEEE Transactions on Software Engineering, 1986
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- Heuristic algorithms for process assignment in distributed computing systemsInformation Processing Letters, 1980
- Dual Processor Scheduling with Dynamic ReassignmentIEEE Transactions on Software Engineering, 1979
- Control of Distributed ProcessesComputer, 1978
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972