Fault-tolerant real-time scheduling

DOI10.1007/s004530010034zbMath0959.68010OpenAlexW2094708479MaRDI QIDQ5915408

Bala Kalyanasundaram, Kirk R. Pruhs

Publication date: 27 August 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010034

zbMATH Keywords

competitive analysisreal-time scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling with limited machine availability, An analysis of totally clairvoyant scheduling, Computing inversion pair cardinality through partition-based sorting, Scheduling with unexpected machine breakdowns, Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm, Algorithms for testing fault-tolerance of sequenced jobs