Scheduling independent jobs on partitionable hypercubes
- 1 May 1991
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 12 (1) , 74-78
- https://doi.org/10.1016/0743-7315(91)90031-4
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Constructing parallel paths between two subcubesIEEE Transactions on Computers, 1992
- Subcube allocation and task migration in hypercube multiprocessorsIEEE Transactions on Computers, 1990
- An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercubeInformation Processing Letters, 1990
- Preemptive scheduling of independent jobs on a hypercubeInformation Processing Letters, 1988
- Processor Allocation in an N-Cube Multiprocessor Using Gray CodesIEEE Transactions on Computers, 1987
- Bounds for List Schedules on Uniform ProcessorsSIAM Journal on Computing, 1980
- Bounds for LPT Schedules on Uniform ProcessorsSIAM Journal on Computing, 1977
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969