SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:research.chalmers.se:99abe5c7-b0ad-4ac0-b3ac-40aa48481294"
 

Search: onr:"swepub:oai:research.chalmers.se:99abe5c7-b0ad-4ac0-b3ac-40aa48481294" > Brief announcement:...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Georgiou, C.University of Cyprus (author)

Brief announcement: Self-stabilizing snapshot objects for asynchronous failure-prone networked systems

  • Article/chapterEnglish2019

Publisher, publication year, extent ...

  • 2019-07-16
  • New York, NY, USA :ACM,2019

Numbers

  • LIBRIS-ID:oai:research.chalmers.se:99abe5c7-b0ad-4ac0-b3ac-40aa48481294
  • https://doi.org/10.1145/3293611.3331584DOI
  • https://research.chalmers.se/publication/513094URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:kon swepub-publicationtype
  • Subject category:ref swepub-contenttype

Notes

  • A snapshot object simulates the behavior of an array of single-writer/multi-reader shared registers that can be read atomically. Delporte-Gallet et al. proposed two fault-tolerant algorithms for snapshot objects in asynchronous crash-prone message-passing systems. Their first algorithm is non-blocking; it allows snapshot operations to terminate once all write operations had ceased. It uses O(n) messages of O(n v) bits, where n is the number of nodes and v is the number of bits it takes to represent the object. Their second algorithm allows snapshot operations to always terminate independently of write operations. It incurs O(n^2) messages. The fault model of Delporte-Gallet et al. considers node failures (crashes). We aim at the design of even more robust snapshot objects. We do so through the lenses of self-stabilization - -a very strong notion of fault-tolerance. In addition to Delporte-Gallet et al.'s fault model, a self-stabilizing algorithm can recover after the occurrence of transient faults; these faults represent arbitrary violations of the assumptions according to which the system was designed to operate (as long as the code stays intact). In particular, in this work, we propose self-stabilizing variations of Delporte-Gallet et al.'s non-blocking algorithm and always-terminating algorithm. Our algorithms have similar communication costs to the ones by Delporte-Gallet et al. and O(1) recovery time (in terms of asynchronous cycles) from transient faults. The main differences are that our proposal considers repeated gossiping of O(v) bits messages and deals with bounded space, which is a prerequisite for self-stabilization.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Lundström, OskarChalmers tekniska högskola,Chalmers University of Technology (author)
  • Schiller, Elad,1974Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)elad (author)
  • University of CyprusChalmers tekniska högskola (creator_code:org_t)

Related titles

  • In:Proceedings of the Annual ACM Symposium on Principles of Distributed ComputingNew York, NY, USA : ACM, s. 209-211

Internet link

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Georgiou, C.
Lundström, Oskar
Schiller, Elad, ...
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Enginee ...
ENGINEERING AND TECHNOLOGY
ENGINEERING AND ...
and Electrical Engin ...
and Signal Processin ...
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Computer Science ...
Articles in the publication
By the university
Chalmers University of Technology

Search outside 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 Close

Copy and save the link in order to return to this view