From unreliable objects to reliable objects: The case of atomic registers and consensus

A concurrent object is an object that can be concurrently accessed by several processes. It has been shown by Maurice Herlihy that any concurrent object O defined by a sequential specification can be wait-free implemented from reliable atomic registers (shared variables) and consensus objects. Wait-free means that any invocation of an operation of the object O issued by a non-faulty process does terminate, whatever the behavior of the other processes (e.g., despite the fact they are very slow or even have crashed).


Published in:
Parallel Computing Technologies, Proceedings, 4671, 47-61
Presented at:
9th International Conference on Parallel Computing Technologies, Pereslavl Zalessky, RUSSIA, Sep 03-07, 2007
Year:
2007
Publisher:
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
ISBN:
978-3-540-73939-5
Laboratories:




 Record created 2012-07-04, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)