TY - GEN
T1 - Bounded concurrent time-stamp systems are constructible
AU - Dolev, Danny
AU - Shavit, Nir
PY - 1989
Y1 - 1989
N2 - Concurrent time stamping is at the heart of solutions to some of the most fundamental problems in distributed computing. Unfortunately, the only known implementation of a concurrent time stamp system has been theoretically unsatisfying, since it requires unbounded size time-stamps, in other words, unbounded memory. In this work, for the first time, a bounded implementation of a concurrent-time-stamp-system is presented. It provides a modular unbounded-to-bounded transformation of simple unbounded solutions.
AB - Concurrent time stamping is at the heart of solutions to some of the most fundamental problems in distributed computing. Unfortunately, the only known implementation of a concurrent time stamp system has been theoretically unsatisfying, since it requires unbounded size time-stamps, in other words, unbounded memory. In this work, for the first time, a bounded implementation of a concurrent-time-stamp-system is presented. It provides a modular unbounded-to-bounded transformation of simple unbounded solutions.
UR - http://www.scopus.com/inward/record.url?scp=0024866904&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0024866904
SN - 0897913078
T3 - Proc Twenty First Annu ACM Symp Theory Comput
SP - 454
EP - 466
BT - Proc Twenty First Annu ACM Symp Theory Comput
PB - Publ by ACM
T2 - Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing
Y2 - 15 May 1989 through 17 May 1989
ER -