Using wait-free synchronization in the design of distributed applications

Authors:
Joseph S. Berrios;Manuel E. Bermudez
Affiliations:
Department of Electrical and Computer Engineering, University of Central Florida, Orlando, FL;Computer and Information Science and Engineering Department, University of Florida, Gainesville, FL
Venue:
Future Generation Computer Systems
Year:
2006

Citing 8
Cited 1

Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
The group lock and its applications

Journal of Parallel and Distributed Computing
Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors

Journal of Parallel and Distributed Computing
Evaluating the performance of non-blocking synchronization on shared-memory multiprocessors

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Foundations of Parallel and Distributed Programming

Foundations of Parallel and Distributed Programming
UNIX Network Programming: Networking APIs: Sockets and XTI

UNIX Network Programming: Networking APIs: Sockets and XTI
Database System Implementation

Database System Implementation
Practical structures for parallel operating systems

Practical structures for parallel operating systems

Symbolic/numeric analysis of chaotic synchronization with a CAS

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

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.