Communications of the ACM - Special section on computer architecture
Bin packing with divisible item sizes
Journal of Complexity
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Preemptive scheduling of independent jobs on a hypercube
Information Processing Letters
An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling Independent Jobs on Hypercubes
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Processor Assignment and Execution Sequence for Multiversion Software
IEEE Transactions on Computers
An Algorithm for Scheduling Jobs in Hypercube Systems
IEEE Transactions on Parallel and Distributed Systems
Real-Time Job Scheduling in Hypercube Systems
ICPP '97 Proceedings of the international Conference on Parallel Processing
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit
Computers and Industrial Engineering
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
Scheduling independent jobs for torus connected networks with/without link contention
Mathematical and Computer Modelling: An International Journal
An Adaptive Scheduler Framework for Complex Workflow Jobs on Grid Systems
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
The problem of scheduling n independent jobs on an m-dimensional hypercube system to minimize the finish time is studied. Each job J/sub i/, where 1or=ior=n, is associated with a dimension d/sub i/ and a processing time t/sub i/, meaning that J/sub i/ needs a d/sub i/-dimensional subcube for t/sub i/ units of time. When job preemption is allowed, an O(n/sup 2/ log/sup 2/ n) time algorithm which can generate a minimum finish time schedule with at most min(n-2,2/sup m/-1) preemptions is obtained. When job preemption is not allowed, the problem is NP-complete. It is shown that a simple list scheduling algorithm called LDF can perform asymptotically optimally and has an absolute bound no worse than 2-1/2/sup m/. For the absolute bound, it is also shown that there is a lower bound (1+ square root 6)/2 approximately=1.7247 for a class of scheduling algorithms including LDF.