On the complexity of multiprocessor task scheduling

zbMath0844.68019MaRDI QIDQ1910619

Maciej Drozdowski

Publication date: 5 September 1996

Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

multiprocessor task scheduling

Mathematics Subject Classification ID

Computer system organization (68M99) Theory of operating systems (68N25)

Related Items

Online scheduling of two type parallel jobs on identical machines ⋮ Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ Bounding the Running Time of Algorithms for Scheduling and Packing Problems ⋮ Scheduling multiprocessor tasks -- An overview