Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing

Document type: Conference Papers
Peer reviewed: Yes
Author(s): Kamilla Klonowska, Lars Lundberg, Håkan Lennerstad, Charlie Svahnberg
Title: Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing
Conference name: IPDPS - 19th International Parallel and Distributed Processing Symposium
Year: 2005
ISBN: 0-7695-2312-9
Publisher: IEEE Computer Society
City: Denver, USA
Organization: Blekinge Institute of Technology
Department: School of Engineering - Dept. Mathematics and Science (Sektionen för teknik – avd. för matematik och naturvetenskap)
School of Engineering S- 371 79 Karlskrona
+46 455 38 50 00
http://www.tek.bth.se/
Authors e-mail: kamilla.klonowska@bth.se, lars.lundberg@bth.se, hakan.lennerstad@bth.se, charlie.svahnberg@bth.se
Language: English
Abstract: Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distributed among the computers. When one or more computers break down the load on these computers must be redistributed to other computers in the cluster. 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. We have previously defined recovery schemes that are optimal for some limited cases. In this paper we find a new recovery schemes that are based on so called Golomb rulers. They are optimal for a much larger number of cases than the previous results.
Subject: Computer Science\Distributed Computing
Mathematics\Discrete Mathematics
Computer Science\Computersystems
Edit