Heuristic algorithms for task assignment and scheduling in a processor network
- 1 January 1994
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 20 (1) , 1-14
- https://doi.org/10.1016/0167-8191(94)90109-0
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Cluster partitioning approaches to mapping parallel programs onto a hypercubeParallel Computing, 1990
- Heuristic algorithms for task assignment in distributed systemsIEEE Transactions on Computers, 1988
- A taxonomy of scheduling in general-purpose distributed computing systemsIEEE Transactions on Software Engineering, 1988
- Nearest-Neighbor Mapping of Finite Element Graphs onto Processor MeshesIEEE Transactions on Computers, 1987
- Heuristic Models of Task Assignment Scheduling in Distributed SystemsComputer, 1982
- On the Mapping ProblemIEEE Transactions on Computers, 1981
- Communication Issues in the Design and Analysis of Parallel AlgorithmsIEEE Transactions on Software Engineering, 1981
- Assignment of Tasks in a Distributed Processor System with Limited MemoryIEEE Transactions on Computers, 1979
- Control of Distributed ProcessesComputer, 1978
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970