Analyzing scheduling with transient failures

DOI10.1016/J.IPL.2009.01.019MaRDI QIDQ987815zbMATH OpenOpenAlexFDO

Authors Erik Saule, Denis Trystram

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

zbMATH Keywords

approximation algorithmmulti-objective optimizationschedulingfault tolerance

Mathematics Subject Classification ID

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)

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1875417 (Why is no real title available?)
• Bounds for Certain Multiprocessing Anomalies
• Multicriteria scheduling problems: a survey

Cited in

(8)

• Reliability and performance optimization of pipelined real-time systems
• Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
• Two-Agent Scheduling with Resource Augmentation on Multiple Machines
• An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
• An approximation algorithm for multi-agent scheduling on two uniform parallel machines
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
• Collective schedules: axioms and algorithms

This page was built for publication: Analyzing scheduling with transient failures

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