Task allocation in fault-tolerant distributed systems
From MaRDI portal
Publication:1836646
DOI10.1007/BF01257086zbMath0505.93041OpenAlexW2137919588MaRDI QIDQ1836646
Kishor S. Trivedi, Joseph A. Bannister
Publication date: 1983
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01257086
Analysis of algorithms and problem complexity (68Q25) Control/observation systems governed by partial differential equations (93C20) Theory of operating systems (68N25)
Related Items (6)
Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms ⋮ A hypergraph theory-based approach to distributed system reliability evaluation ⋮ Regulation of task differentiation in wasp societies: a bottom-up model of the ``common stomach ⋮ Real-time task reallocation in fault-tolerant distributed computer systems ⋮ Heuristic methods and applications: A categorized survey ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
Cites Work
- Unnamed Item
- Optimal Selection of CPU Speed, Device Capacities, and File Assignments
- Optimal Design of Multilevel Storage Hierarchies
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- On a Real-Time Scheduling Problem
- Assignment of Tasks in a Distributed Processor System with Limited Memory
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Task allocation in fault-tolerant distributed systems