Online randomized multiprocessor scheduling
From MaRDI portal
Publication:1580957
DOI10.1007/S004530010014zbMath0961.68018OpenAlexW2027131870MaRDI QIDQ1580957
Publication date: 28 May 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004530010014
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Competitive ratio of list scheduling on uniform machines and randomized heuristics ⋮ Randomized on-line scheduling on three processors. ⋮ Semi-online scheduling with decreasing job sizes ⋮ Randomized on-line scheduling on two uniform machines ⋮ A manifesto for the computational method ⋮ Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
This page was built for publication: Online randomized multiprocessor scheduling
