zbMATH — the first resource for mathematics

An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube. (English) Zbl 0704.68052
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.

68Q25 Analysis of algorithms and problem complexity
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
68M01 General theory of computer systems
Full Text: DOI
[1] Chen, G.I.; Lai, T.H., Preemptive scheduling of independent jobs on a hypercube, Inform. process. lett., 28, 201-206, (1988) · Zbl 0658.68041
[2] Horowitz, E.; Sahni, S., Fundamentals of data structures, (1976), Computer Science Press Potomac, MD · Zbl 0408.68003
[3] Sahni, S., Preemptive scheduling with due dates, Oper. res., 27, 5, 925-934, (1979) · Zbl 0424.90031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.