Analyzing scheduling with transient failures
From MaRDI portal
Publication:987815
DOI10.1016/j.ipl.2009.01.019zbMath1214.68104OpenAlexW2074766782MaRDI QIDQ987815
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.019
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (7)
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Collective schedules: axioms and algorithms ⋮ Reliability and performance optimization of pipelined real-time systems ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
Cites Work
This page was built for publication: Analyzing scheduling with transient failures
