Dynamic scheduling on parallel machines
From MaRDI portal
Publication:1331960
DOI10.1016/0304-3975(94)90152-XzbMath0811.68060OpenAlexW2127960094MaRDI QIDQ1331960
Shang-Hua Teng, Anja Feldmann, Jiří Sgall
Publication date: 12 June 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90152-x
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Distributed algorithms (68W15)
Related Items
Maximizing the throughput of parallel jobs on hypercubes ⋮ On-line scheduling mesh jobs with dependencies ⋮ Scheduling parallel jobs to minimize the makespan ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ On maximizing the throughput of multiprocessor tasks. ⋮ Competitive ratio of list scheduling on uniform machines and randomized heuristics ⋮ An effective approximation algorithm for the malleable parallel task scheduling problem ⋮ Competitive online scheduling of perfectly malleable jobs with setup times ⋮ Scheduling with uncertainties on new computing platforms ⋮ Online strip packing with modifiable boxes ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Design and performance of a scheduling framework for resizable parallel applications ⋮ On-line scheduling of multi-core processor tasks with virtualization ⋮ On-line scheduling of parallel jobs with runtime restrictions ⋮ PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN ⋮ Fairness in parallel job scheduling ⋮ On an on-line scheduling problem for parallel jobs
Cites Work
