Real-time task reallocation in fault-tolerant distributed computer systems

DOI10.1016/0305-0548(86)90055-9zbMath0615.90051OpenAlexW2059881150MaRDI QIDQ1821015

Alan W. Neebe, Joseph B. Mazzola

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90055-9

zbMATH Keywords

heuristicfault-tolerant systemComputational experimentsreal-time task reallocation

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Task allocation in fault-tolerant distributed systems
• A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems
• An Algorithm for Large Zero-One Knapsack Problems
• A Direct Descent Binary Knapsack Algorithm
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Real-time task reallocation in fault-tolerant distributed computer systems