Parallel and Distributed Processing Symposium, International (2005)
Apr. 4, 2005 to Apr. 8, 2005
Kamilla Klonowska , Blekinge Institute of Technology, Sweden
Lars Lundberg , Blekinge Institute of Technology, Sweden
H?kan Lennerstad , Blekinge Institute of Technology, Sweden
Charlie Svahnberg , Blekinge Institute of Technology, Sweden
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.<div></div> 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.<div></div> 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.
H. Lennerstad, L. Lundberg, C. Svahnberg and K. Klonowska, "Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing," 19th IEEE International Parallel and Distributed Processing Symposium(IPDPS), Denver, CO, 2005, pp. 279a.