Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model

Authors:
Hyonho Lee
Affiliations:
University of Toronto
Venue:
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Year:
2005

Citing 0
Cited 5

An O(1) RMRs leader election algorithm

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Achieving causal and total ordering in publish/subscribe middleware with DSM

Proceedings of the 3rd workshop on Middleware for service oriented computing
Ordenação de eventos baseada em DSM para middlewares publish/subscribe

Companion Proceedings of the XIV Brazilian Symposium on Multimedia and the Web
An $O(1)$ RMRs Leader Election Algorithm

SIAM Journal on Computing
A complexity separation between the cache-coherent and distributed shared memory models

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two transformations that convert a class of local-spin mutual exclusion algorithms on the cache-coherent model to local-spin mutual exclusion algorithms on the distributed shared memory model without increasing their time complexity. Our first transformation uses registers and test-and-set objects, and does not increase the number of busy-waiting periods. The second transformation uses only registers, but contains two busy-waiting periods for each busy-waiting period of the input algorithm. We carefully define the class of mutual exclusion algorithms that are applicable to our transformations, and formally prove the correctness of our transformations.