Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy

DOI10.1007/978-3-642-40164-0_16zbMath1390.68124arXiv1306.1861OpenAlexW2144565901MaRDI QIDQ2842781

Elli Zavou, Dariusz R. Kowalski, Chryssis Georgiou, Antonio Fernández Anta

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.1861

zbMATH Keywords

schedulingonline algorithmsenergy efficiencycompetitivenessfailuresnon-uniform tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online Packet Scheduling Under Adversarial Jamming ⋮ On packet scheduling with adversarial jamming and speedup

This page was built for publication: Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy