Abstract
A fault-tolerant and practically stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash. The simulation stabilizes in a practically stabilizing manner, by reaching a long execution in which it runs correctly. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme accommodating arbitrary labels, including those not generated by the scheme itself.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 692-701 |
| Number of pages | 10 |
| Journal | Journal of Computer and System Sciences |
| Volume | 81 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jun 1 2015 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics
Keywords
- Message passing
- Self-stabilization
- Shared memory
- Single writer multiple reader register
Fingerprint
Dive into the research topics of 'Practically stabilizing SWMR atomic memory in message-passing systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver