Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Optimal recovery schemes in fault tolerant distributed computing
Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, Avdelningen för matematik och naturvetenskap.
Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
2005 (engelsk)Inngår i: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 41, nr 6, s. 341-365Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
Springer Verlag , 2005. Vol. 41, nr 6, s. 341-365
HSV kategori
Identifikatorer
URN: urn:nbn:se:bth-6415DOI: 10.1007/s00236-005-0161-7ISI: 000228546000002Lokal ID: oai:bth.se:forskinfo08F5EB6C8C8D190EC12573CA004CCF81OAI: oai:DiVA.org:bth-6415DiVA, id: diva2:833921
Tilgjengelig fra: 2015-02-17 Laget: 2008-01-08 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Person

Lennerstad, HåkanLundberg, Lars

Søk i DiVA

Av forfatter/redaktør
Lennerstad, HåkanLundberg, Lars
Av organisasjonen
I samme tidsskrift
Acta Informatica

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 195 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf