Online parallel scheduling of non-uniform tasks: trading failures for energy
DOI10.1016/J.TCS.2015.01.027zbMATH Open1327.68337OpenAlexW1964774786MaRDI QIDQ2348044FDOQ2348044
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
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
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. Theory, algorithms, and systems.
- 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)
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)
