an:04155890
Zbl 0704.68052
Ahuja, Mohan; Zhu, Yahui
An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
EN
Inf. Process. Lett. 35, No. 1, 7-11 (1990).
00156002
1990
j
68Q25 68M20 68M01
preemptive scheduling; hypercube; balanced search tree
Summary: We present a new feasibility algorithm to decide if n independent jobs can be finished by a given deadline T on an m-dimensional hypercube system. It takes \(O(n \log n)\) time and generates a schedule with at most \(n-2\) preemptions. A previous known algorithm takes \(O(n^ 2)\) time and produces a schedule with up to \({1/2} n(n-1)\) preemptions.