SwePub
Sök i LIBRIS databas

  Utökad sökning

onr:"swepub:oai:research.chalmers.se:0f727051-54ed-4038-98c0-86be241dd016"
 

Sökning: onr:"swepub:oai:research.chalmers.se:0f727051-54ed-4038-98c0-86be241dd016" > Self-stabilizing vi...

  • Dolev, ShlomiBen-Gurion University of the Negev (författare)

Self-stabilizing virtual synchrony

  • Artikel/kapitelEngelska2015

Förlag, utgivningsår, omfång ...

  • 2015-08-04
  • Cham :Springer International Publishing,2015
  • electronicrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:research.chalmers.se:0f727051-54ed-4038-98c0-86be241dd016
  • ISBN:9783319217406
  • https://research.chalmers.se/publication/224846URI
  • https://doi.org/10.1007/978-3-319-21741-3_17DOI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:kon swepub-publicationtype
  • Ämneskategori:ref swepub-contenttype

Anmärkningar

  • Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the success of such implementations since large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant. Self-stabilizing systems can tolerate transient faults that drive the system to an arbitrary unpredictable configuration. Such systems automatically regain consistency from any such configuration, and then produce the desired system behavior ensuring it for practically infinite number of successive steps, e.g., 264 steps. We present a new multi-purpose self-stabilizing counter algorithm establishing an efficient practically unbounded counter, that can directly yield a self-stabilizing Multiple-Writer Multiple-Reader (MWMR) register emulation. We use our counter algorithm, together with a selfstabilizing group membership and a self-stabilizing multicast service to devise the first practically stabilizing VS algorithm and a self-stabilizing VS-based emulation of state machine replication (SMR). As we base the SMR implementation on VS, rather than consensus, the system progresses in more extreme asynchronous settings in relation to consensusbased SMR.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Georgiou, C.University of Cyprus (författare)
  • Marcoullis, I.University of Cyprus (författare)
  • Schiller, Elad,1974Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)elad (författare)
  • Ben-Gurion University of the NegevUniversity of Cyprus (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Cham : Springer International Publishing9212, s. 248-2641611-33490302-97439783319217406

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy