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

DOI10.1016/j.tcs.2015.01.027zbMath1327.68337MaRDI QIDQ2348044

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

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

scheduling; online algorithms; energy efficiency; competitiveness; failures; non-uniform tasks

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

Fault tolerant scheduling of tasks of two sizes under resource augmentation, Online packet scheduling under adversarial errors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for Scheduling Jobs on Grid Processors
• Meeting Deadlines: How Much Speed Suffices?
• Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
• At-Most-Once Semantics in Asynchronous Shared Memory
• Algorithms for the Certified Write-All Problem
• Performing tasks on synchronous restartable message-passing processors
• The complexity of synchronous iterative Do-All with crashes
• Online set packing and competitive scheduling of multi-part tasks
• Scheduling