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

Authors:
Kamilla Klonowska;Lars Lundberg;Hakan Lennerstad;Charlie Svahnberg
Affiliations:
Blekinge Institute of Technology, Sweden;Blekinge Institute of Technology, Sweden;Blekinge Institute of Technology, Sweden;Blekinge Institute of Technology, Sweden
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
Year:
2005

Citing 7
Cited 0

In search of clusters (2nd ed.)

In search of clusters (2nd ed.)
Optimal recovery schemes for high-availability cluster and distributed computing

Journal of Parallel and Distributed Computing - Special issue on cluster and network-based computing
Genetic Algorithm Approach to the Search for Golomb Rulers

Proceedings of the 6th International Conference on Genetic Algorithms
Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Using Golomb Rulers for Optimal Recovery Schemes in Fault Tolerant Distributed Computing

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing

PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Optimal recovery schemes in fault tolerant distributed computing

Acta Informatica

Quantified Score

Hi-index	0.00

Visualization

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.