Online parallel scheduling of non-uniform tasks: trading failures for energy

DOI10.1016/J.TCS.2015.01.027MaRDI QIDQ2348044zbMATH OpenOpenAlexFDO

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

Publication date 10 June 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.01.027

zbMATH Keywords

online algorithmsenergy efficiencyschedulingcompetitivenessfailuresnon-uniform tasks

Mathematics Subject Classification ID

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

Recommendations

• Online parallel scheduling of non-uniform tasks: trading failures for energy
• Fault tolerant scheduling of tasks of two sizes under resource augmentation
• Energy efficient scheduling of parallelizable jobs
• Energy Efficient Scheduling of Parallelizable Jobs
• Dynamic on-line task scheduling on parallel processors

Cites work

• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 1033646 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Algorithms for the Certified Write-All Problem
• At-Most-Once Semantics in Asynchronous Shared Memory
• Bounds for scheduling jobs on grid processors
• Meeting deadlines: how much speed suffices?
• Online set packing and competitive scheduling of multi-part tasks
• Performing dynamically injected tasks on processes prone to crashes and restarts
• Performing tasks on synchronous restartable message-passing processors
• Race to idle: new algorithms for speed scaling with a sleep state
• Scheduling. Theory, algorithms, and systems.
• Speed scaling with an arbitrary power function
• The complexity of synchronous iterative do-all with crashes

Cited in

(4)

• Online packet scheduling under adversarial errors
• Optimizing throughput and energy in online deadline scheduling
• Online parallel scheduling of non-uniform tasks: trading failures for energy
• Fault tolerant scheduling of tasks of two sizes under resource augmentation

This page was built for publication: Online parallel scheduling of non-uniform tasks: trading failures for energy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348044)