Fast, long-lived renaming improved and simplified

Authors:
Mark Moir;Juan A. Garay
Affiliations:
University of North Carolina at Chapel Hill;CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands
Venue:
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Year:
1996

The ambiguity of choosing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Wait-free algorithms for fast, long-lived renaming

Science of Computer Programming
Long-lived renaming made fast

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing

Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Long-lived renaming made adaptive

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
NOrec: streamlining STM by abolishing ownership records

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Optimal-time adaptive strong renaming, with applications to counting

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Hi-index	0.02