Title

Using wait-free synchronization in the design of distributed applications

Authors

Authors

J. S. Berrios;M. E. Bermudez

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Futur. Gener. Comp. Syst.

Keywords

concurrency; non-blocking algorithms; Computer Science, Theory & Methods

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. (c) 2005 Elsevier B.V. All rights reserved.

Journal Title

Future Generation Computer Systems-the International Journal of Grid Computing Theory Methods and Applications

Volume

22

Issue/Number

1-2

Publication Date

1-1-2006

Document Type

Article; Proceedings Paper

Language

English

First Page

46

Last Page

56

WOS Identifier

WOS:000234408800007

ISSN

0167-739X

Share

COinS