Task allocation in fault-tolerant distributed systems

DOI10.1007/BF01257086MaRDI QIDQ1836646zbMATH OpenOpenAlexFDO

Authors Joseph A. Bannister, Kishor S. Trivedi

Publication date 1983

Published in Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmtask allocationfault-tolerant distributed systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Control/observation systems governed by partial differential equations (93C20) Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• On a Real-Time Scheduling Problem
• Optimal Design of Multilevel Storage Hierarchies
• Optimal Selection of CPU Speed, Device Capacities, and File Assignments
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation

Cited in

(6)

• On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
• Heuristic methods and applications: A categorized survey
• Regulation of task differentiation in wasp societies: a bottom-up model of the ``common stomach
• Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms
• Real-time task reallocation in fault-tolerant distributed computer systems
• A hypergraph theory-based approach to distributed system reliability evaluation

This page was built for publication: Task allocation in fault-tolerant distributed systems

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