By Topic

Optimistic synchronization in distributed shared memory

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)
G. Hermannsson ; Renaissance Technol. Corp., Stony Brook, NY, USA ; L. Wittie

Introduces optimistic lock synchronization using the group write consistency (GWC) model. GWC guarantees strict ordering of all shared writes in a processor group. In optimistic synchronization, if a lock-requesting processor can assume that the lock is free, execution of mutually exclusive code starts immediately. A wrong assumption results in rollback. Shared variable updates remain in the group until the lock manager grants the lock to the requesting processor. By evaluating the time needed for three processors to execute mutually exclusive code, GWC can out-perform weak, release, and even entry consistency. Simulations of task management using exclusive access to a shared queue, also show much faster mutual exclusion with GWC. Optimistic mutual exclusion may further halve total delays in accessing shared resources

Published in:

Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on

Date of Conference:

21-24 Jun 1994