By Topic

Fast locks in distributed shared memory 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)
Hermannsson, G. ; SUNY, Stony Brook, NY, USA ; wittie, L.

Synchronization and remote memory access delays cause staggering inefficiency in most shared memory programs if run on thousands of processors. The authors introduce efficient lock synchronization using the combination of group write consistency, which guarantees write ordering within groups of processors, and eagersharing distributed memory, which sends newly written data values over fast network links whenever shared data are written locally. This fast locking method uses queue-based locks and a group root as a lock manager. Write ordering allows lock grants and releases to immediately follow final shared data writes. Most other consistency models need shared writes to be completed globally before lock release. Program execution times are much shorter using group write consistency than weak, release, or entry consistency.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:1 )

Date of Conference:

4-7 Jan. 1994