Published Articles >> Table of Contents >> Abstract

10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)   pp. 133-142
Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing
Kamilla Klonowska, Blekinge Institute of Technology
Lars Lundberg, Blekinge Institute of Technology
Hakan Lennerstad, Blekinge Institute of Technology
Charlie Svahnberg, Blekinge Institute of Technology

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PRDC.2004.1276564
Send link to a friend

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. In this paper we define recovery schemes, which are optimal for a larger number of computers down than in previous results. We also show that the problem of finding optimal recovery schemes for a cluster with n computers corresponds to the mathematical problem of finding the longest sequence of positive integers for which the sum of the sequence and the sums of all subsequences modulo n are unique.
Back to Top Additional Information
Index Terms- fault tolerance, high performance computing, recovery schemes, Golomb rulers, modulo sequence Citation:  Kamilla Klonowska, Lars Lundberg, Hakan Lennerstad, Charlie Svahnberg, "Using Modulo Rulers for Optimal Recovery Schemes in Distributed Computing," prdc, pp. 133-142,  10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04),  2004