Nonmigratory Online Deadline Scheduling on Multiprocessors

DOI10.1137/S0097539703435765zbMath1075.68007OpenAlexW3138119376WikidataQ58063008 ScholiaQ58063008MaRDI QIDQ5317168

Kar-Keung To, Ho-Leung Chan, Tak-Wah Lam

Publication date: 16 September 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539703435765

zbMATH Keywords

multiprocessor schedulingcompetitive analysisonline algorithmsresource augmentationjob migration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items (4)

An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness ⋮ Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing

This page was built for publication: Nonmigratory Online Deadline Scheduling on Multiprocessors