A Performance Comparison of Fast Distributed Synchronization Algorithms (1994)
| Venue: | In International Conference on Parallel Processing |
| Citations: | 15 - 1 self |
BibTeX
@INPROCEEDINGS{Johnson94aperformance,
author = {Theodore Johnson},
title = {A Performance Comparison of Fast Distributed Synchronization Algorithms},
booktitle = {In International Conference on Parallel Processing},
year = {1994},
pages = {258--264},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Distributed synchronization is an essential component of parallel and distributed computing. Several fast and low-overhead distributed synchronization algorithms have been proposed. Each of these algorithms required O(log n) messages per critical section entry and O(log n) bits of storage per processor. Asymptotic performance estimates do not proclaim any of the algorithms to be a winner, but no performance comparison of the algorithms has yet been performed. In this paper, we make a comparative performance study of four distributed semaphore algorithms. Each of these algorithms represents a different approach to maintaining distributed information. Since the algorithms we study are the basis for distributed synchronization, distributed virtual memory, coherent caches, and distributed object systems, our results have implications about the best methods for their implementation. We find that the distributed synchronization algorithm of Chang, Singhal, and Liu has the overall best perfor...
