Fault-tolerant scheduling (extended abstract)
DOI10.1145/195058.195115zbMATH Open1344.68038OpenAlexW2002345807MaRDI QIDQ2817601FDOQ2817601
Authors: Bala Kalyanasundaram, Kirk Pruhs
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195115
Recommendations
Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)
Cited In (16)
- On-line two-machine open shop scheduling with time lags
- Fault-Tolerant Scheduling
- FESTAL: Fault-Tolerant Elastic Scheduling Algorithm for Real-Time Tasks in Virtualized Clouds
- Scheduling multiprocessor tasks in presence of correlated failures.
- On redundancy elimination tolerant scheduling rules
- Closed form solution for response time of fault tolerant network of processors
- Fault-tolerant real-time scheduling
- A fault-tolerant scheduling problem
- Scheduling with limited machine availability
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Title not available (Why is that?)
- Algorithms for testing fault-tolerance of sequenced jobs
- Scheduling with unexpected machine breakdowns
- Fault tolerant scheduling of tasks of two sizes under resource augmentation
- DEFT: dynamic fault-tolerant elastic scheduling for tasks with uncertain runtime in cloud
- Optimal Fault-Secure Scheduling
This page was built for publication: Fault-tolerant scheduling (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817601)