Title
Using Wait-Free Synchronization In The Design Of Distributed Applications
Keywords
Concurrency; Non-blocking algorithms
Abstract
Wait-free synchronization has been recognized in the literature as an effective concurrent programming technique. The concurrent programming community, however, has been slow to adopt this technique. This paper addresses the practical application of wait-free synchronization in the design of distributed applications. In this paper, we present an implementation of a server that uses wait-free synchronization. The resulting code is more easily seen to be fault tolerant. The performance analysis of the wait-free synchronization server outperformed a server that uses traditional locking techniques. This practical demonstration of the benefits of wait-free synchronization should help foster its adoption in the development of distributed applications. © 2005 Elsevier B.V. All rights reserved.
Publication Date
1-1-2006
Publication Title
Future Generation Computer Systems
Volume
22
Issue
1-2
Number of Pages
46-56
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/j.future.2004.11.012
Copyright Status
Unknown
Socpus ID
26444611476 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/26444611476
STARS Citation
Berrios, Joseph S. and Bermudez, Manuel E., "Using Wait-Free Synchronization In The Design Of Distributed Applications" (2006). Scopus Export 2000s. 9160.
https://stars.library.ucf.edu/scopus2000/9160