Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimal recovery schemes in fault tolerant distributed computing
Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
Blekinge Institute of Technology, School of Engineering, Department of Mathematics and Natural Sciences.
Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
2005 (English)In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 41, no 6, 341-365 p.Article in journal (Refereed) Published
Abstract [en]

Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n 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 system. The redistribution is determined by the recovery scheme. The recovery scheme is governed by a sequence of integers modulo n. Each sequence guarantees minimal load on the computer that has maximal load even when the most unfavorable combinations of computers go down. We calculate the best possible such recovery schemes for any number of crashed computers by an exhaustive search, where brute force testing is avoided by a mathematical reformulation of the problem and a branch-and-bound algorithm. The search nevertheless has a high complexity. Optimal sequences, and thus a corresponding optimal bound, are presented for a maximum of twenty one computers in the distributed system or cluster.

Place, publisher, year, edition, pages
Springer Verlag , 2005. Vol. 41, no 6, 341-365 p.
National Category
Mathematical Analysis Computer Science
Identifiers
URN: urn:nbn:se:bth-6415DOI: 10.1007/s00236-005-0161-7ISI: 000228546000002Local ID: oai:bth.se:forskinfo08F5EB6C8C8D190EC12573CA004CCF81OAI: oai:DiVA.org:bth-6415DiVA: diva2:833921
Available from: 2015-02-17 Created: 2008-01-08 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lennerstad, HåkanLundberg, Lars
By organisation
Department of Systems and Software EngineeringDepartment of Mathematics and Natural Sciences
In the same journal
Acta Informatica
Mathematical AnalysisComputer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 53 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf