A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems

DOI10.1002/nav.3800300314zbMath0539.90034OpenAlexW2048861065MaRDI QIDQ3328229

Joseph B. Mazzola, Alan W. Neebe

Publication date: 1983

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800300314

zbMATH Keywords

system reliabilitycomputational experienceheuristic proceduretask allocationfault-tolerant distributed computer systems

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• A Direct Descent Binary Knapsack Algorithm
• 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: A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems