J. M. Mellor-Crummey and M. L. Scott. Synchronization without contention. In Proceedings of The 4th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 269-278, Apr. 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....QOLB, IQOLB does not require any instruction set support nor does it require any software changes. Software queue based locking schemes were proposed by Anderson [9, 10] and Graunke and Thakkar [55] Mellor Crummey and Scott proposed MCS, an improvement to Anderson s algorithm. The MCS scheme [120, 121] is a software based queued lock scheme. MCS adds requesters for a held lock into a software queue at the time of the request, using atomic operations such as swap and compare swap to update the list. Arbitration for the eventual recipient of the lock is therefore performed in advance, first come, ....

....all attempt a test set. Only one of the requestors succeeds in the test set. The contention when the lock is freed can be substantial because all requesters attempt to acquire the lock at that point and then all attempt to upgrade the lock to a writable state. 5.4.3. 2 MCS locks The MCS scheme [120, 121] inserts requesters for a held lock into a software queue at the time of the request. Atomic operations such as swap and compare swap are used to update the list correctly. With queue based locking, arbitration for the eventual recipient of the lock is therefore performed in advance, first come, ....

John M. Mellor-Crummey and Michael L. Scott. Synchronization Without Contention. In Proceedings of the Fourth Symposium on Architectural Support for Programming Languages and Operating Systems, pages 269--278, April 1991.

....resolve contention among multiple messages trying to acquire the same channel, link allocation policies among virtual channels, buffer sizes, and memory management policies. Also, we implement a directory based cache coherence protocol [10] in our simulator and realistic synchronization techniques [11]. Consideration of all the network parameters and their effect on the system performance is beyond the scope of this paper because of the time and space constraints. Here, we will limit ourselves to two switching techniques packet switching and wormhole routing. The comparison of packet ....

....controllers detect if a message has arrived out of order and holds it to be serviced later. The scheme is similar to the scheme used in MIT Alewife system [14] The synchronization method used in our simulations is based on spin locks using test5 test and set operation with exponential backoff [11]. Barriers used in many of the applications were implemented using a shared counter. We also experimented with other types of barriers to reduce contention, however, our experience suggests that the main overhead in synchronization is the contention for the lock itself, not for the shared variable ....

J. M. Mellor-Crummey and M. L. Scott, "Synchronization Without Contention," In Proceedings of Fourth Int. Conf. on Architectural Support for Programming Languages and Operating Systems, pp. 269--278, Santa Clara, CA, April 1991, ACM.

....controllers detect if a message has arrived out of order and holds it to be serviced later. The scheme is similar to the scheme used in MIT Alewife system [17] The synchronization method used in our simulations is based on spinlocks using test testand set operation with exponential backoff [18]. Barriers used in many of the applications were implemented using a shared counter. We also experimented with other types of barriers to reduce contention, however, our experience suggests that the main overhead in synchronization is the contention for the lock itself, not for the shared variable ....

J. M. Mellor-Crummey and M. L. Scott, "Synchronization Without Contention," In Proceedings of Fourth Int. Conf. on Architectural Support for Programming Languages and Operating Systems, pp. 269--278, Santa Clara, CA, April 1991, ACM.

....important to develop high throughput, low contention synchronization mechanisms. In this paper we describe our research on reader writer synchronization for shared memory multiprocessors. Recent work has focused on developing good algorithms for mutual exclusion on shared memory multiprocessors [2, 12, 14]. Lamport s work [12] concentrates on minimizing the number of remote memory accesses; unfortunately, his algorithm leads to spinning over the network in the absence of caches. Anderson s lock [2] and Mellor Crummey and Scott s lock [14] are similar: they both use fetchand add (or similar ....

....for mutual exclusion on shared memory multiprocessors [2, 12, 14] Lamport s work [12] concentrates on minimizing the number of remote memory accesses; unfortunately, his algorithm leads to spinning over the network in the absence of caches. Anderson s lock [2] and Mellor Crummey and Scott s lock [14] are similar: they both use fetchand add (or similar operations) to eliminate remote spinning; as a result, their algorithms generate very little network traffic. Reader writer locks relax the constraints of mutual exclusion: a given reader writer lock can be held by multiple readers, but can ....

[Article contains additional citation context not shown here]

John M. Mellor-Crummey and Michael L. Scott. Synchronization Without Contention. In Proceed- ings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, April 8-11, 1991, pages 269-278.

No context found.

J. M. Mellor-Crummey and M. L. Scott. Synchronization without contention. In Proceedings of The 4th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 269-278, Apr. 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC