Eliminating Migration in Multi-processor Scheduling

DOI10.1006/JAGM.2000.1128zbMath0969.68026OpenAlexW2007439549MaRDI QIDQ2709789

Bala Kalyanasundaram, Kirk R. Pruhs

Publication date: 7 October 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1128

zbMATH Keywords

real-time multi-processor scheduling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Average stretch without migration ⋮ A competitive algorithm for throughput maximization on identical machines ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing

This page was built for publication: Eliminating Migration in Multi-processor Scheduling