By Topic

Efficient implementation of mutual exclusion locks in large multiprocessors

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
$33 $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)
Nian-Feng Tzeng ; Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA ; S. S. Fu

To ensure proper mutual exclusion, a lock is often employed to determine the processor among those which compete for the critical section. Accesses to such a mutual exclusion lock may create heavy synchronization traffic and/or serious contention over the network, thereby degrading system performance considerably. In this paper, we introduce an efficient lock scheme which keeps synchronization traffic low and avoids serious hot-spot contention. This is made possible by constructing a ring of the processors waiting for the critical section and by dispersing accesses to the lock. Our simulation results demonstrate that the proposed scheme indeed achieves better performance than prior techniques, promising good scalability

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995