An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube

DOI10.1016/0020-0190(90)90166-UzbMath0704.68052MaRDI QIDQ917300

Yahui Zhu, Mohan L. Ahuja

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

hypercubepreemptive schedulingbalanced search tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General theory of computer systems (68M01)

Related Items

Scheduling on a hypercube ⋮ Scheduling of independent jobs in star graph networks ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Scheduling independent jobs for torus connected networks with/without link contention.

Cites Work

• Unnamed Item
• Preemptive scheduling of independent jobs on a hypercube
• Preemptive Scheduling with Due Dates