On redundancy elimination tolerant scheduling rules

DOI10.1017/S1471068401001235zbMATH Open1105.68328OpenAlexW1979010687MaRDI QIDQ4452641FDOQ4452641

Giuliano Pacini, Maria I. Sessa, Filomena Ferrucci

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068401001235

Recommendations

• Schedulers and redundancy for a class of constraint propagation rules
• Redundancy scheduling with scaled Bernoulli service requirements
• Fault-tolerant scheduling (extended abstract)
• Redundant task-allocation in multicomputer systems
• Fault-Tolerant Scheduling
• Fault-tolerant scheduling in homogeneous real-time systems
• Minimum congestion redundant assignments to tolerate random faults

zbMATH Keywords

loop checkstack-queue scheduling rule

Mathematics Subject Classification ID

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

Cited In (1)

• Schedulers and redundancy for a class of constraint propagation rules

This page was built for publication: On redundancy elimination tolerant scheduling rules

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