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

DOI10.1016/J.TCS.2015.01.027zbMATH Open1327.68337OpenAlexW1964774786MaRDI QIDQ2348044FDOQ2348044

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

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)

Cites Work

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

Cited In (3)

• Online packet scheduling under adversarial errors
• Optimizing throughput and energy in online deadline scheduling
• 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)