Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing

Document type: Conference Papers
Peer reviewed: Yes
Author(s): Lars Lundberg, Daniel Häggander, Kamilla Klonowska, Charlie Svahnberg
Title: Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing
Conference name: Eleventh International Workshop on Parallel and Distributed Real-Time Systems
Year: 2003
ISBN: 0-7695-1926-1
Publisher: IEEE
City: Nice, France
Organization: Blekinge Institute of Technology
Department: Department of Software Engineering and Computer Science (Institutionen för programvaruteknik och datavetenskap)
Dept. of Software Engineering and Computer Science S-372 25 Ronneby
+46 455 38 50 00
http://www.bth.se/eng/ipd/
Authors e-mail: lars.lundberg@bth.se, daniel.haggander@bth.se, kamilla.klonowska@bth.se, charlie.svahnberg@bth.se
Language: English
Abstract: Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers-fail the must be redistributed. The redistribution is determined by the recovery scheme. The recovery scheme should keep the load as evenly distributed as possible even when the most unfavorable combinations of computers break down, i.e. we want to optimize the worst-case behavior. In this paper we define recovery schemes, which are optimal for a number of important cases. We also show that the problem of finding optimal recovery schemes corresponds to the mathematical problem of finding sequences of integers with minimal sum and for which all sums of subsequences are unique.
Subject: Computer Science\Computersystems
Keywords: fault tolerant computing, real-time systems, resource allocation, system recovery
Edit