Cart (Loading....) | Create Account
Close category search window
 

A log(n) multi-mode locking protocol for distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Desai, N. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA ; Mueller, F.

Trends in high-end clusters are to deploy an ever larger number of processors to push the envelope on parallelizing scientific applications. A similar trend exists in server computing where more and more servers are composed into a farm. One of the main challenges in such environments is to achieve scalability of synchronization, specifically for locking. Our work focuses on scalable locking in distributed systems. At its essence is a peer-to-peer protocol for multi-mode hierarchical locking, which is applicable to transaction-style processing and distributed agreement. We demonstrate high scalability combined with low response times in high-performance cluster environments. Our experiments on an IBM SP show that the number of messages approaches an asymptote at 15 nodes, from which point on the message overhead is in the order of 3-9 messages per request, depending on system parameters. At the same time, response times increase linearly with a proportional increase in requests and, consequently, higher concurrency levels. We observed response times under 2 and 10 msec for up to 25 and 80 nodes for critical sections that are one 25th the size of non-critical code. Our approach benefits in large from high levels of concurrency upon resolving requests and dynamic path compression for request propagation. Besides its technical strengths, our approach is intriguing due to its simplicity and its wide applicability, ranging from large-scale clusters to server-style computing.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.