J.M. Mellor-Crummey and M.L. Scott. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. Technical Report 342, UniversityofRochester, Rochester, NY 14627, April 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Multithreaded Constraint Programming and Applications - Zabatta (Correct)
....limits the number of concurrent operations to one. This can severely limit the performance gains of parallelization. In order to maximize performance gains from parallelization, data structures must maintain a high level of concurrency. Several researchers such as [BB,87] RK,88] Jones,89] CS,91] HMPS,96] MSL,96] have developed concurrent data structures for shared memory architectures that can be directly applied to multithreaded applications. These data structures fall into two categories: blocking and non blocking. A blocking data structure uses synchronization objects based on the ....
Mellor-Crummey, J. M.; Scott, M.L: Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors, ACM Transactions on Computer Systems, February, 1991.
Synchronization Support Using Full/Empty Tagged Shared Memory .. - Vlassov, Moritz (Correct)
....and barriers is ease of programming, being the reason why such type of synchronization is widely used in shared memory multiprocessors. A number of software and hardware implementations and optimizations were proposed for efficient lock and barrier synchronization in shared memory multiprocessors [15], such as the followings: a test test and set spinlock, a spinlock with exponential back off, software queuing locks and cache based queuing locks. As reported in [11] a cache based queuing lock, called QOLB (Queue on Lock Bit) is 4 shown be the most efficient coarse grain synchronization ....
J. M. Mellor-Crummey and M. L. Scott. Algorithms for Scalable Synchronization on SharedMemory Multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, February 1991.
Nonblocking Concurrent Data Structures with Condition.. - III, Scott (2004) Self-citation (Scott) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, February 1991.
Preemption Adaptivity in Time-Published Queue-Based Spin Locks - He, III, Scott (2005) Self-citation (Scott) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on sharedmemory multiprocessors. ACM Trans. on Computer Systems, 9(1):21--65, 1991.
Non-Blocking Timeout in Scalable Queue-Based Spin Locks - Michael Scott Department (2002) (3 citations) Self-citation (Scott) (Correct)
....timeout in a queue based lock. 1Introduction Spin locks are widely used for mutual exclusion on shared memory multiprocessors. Traditional test and set based spin locks are vulnerable to memory and interconnect contention, and do not scale well to large machines. Queue based spin locks [2, 5, 7, 13, 15] avoid contention by arranging for every waiting thread to spin on a separate, local flag in memory. Over the past ten years queuebased locks have been incorporated into a variety of academic and commercial operating systems, This work was supported in part by NSF grants numbers EIA 0080124 and ....
....lock are linked into an explicit data structure. A timed out thread must somehow introduce its neighbors in the queue to one another, even in cases where the neighbors may also be timing out. In a recent paper [17] we introduced timeout capable queue based try locks based on our MCS lock [15] and on the related CLH lock, due to Craig [5] and to Landin and Hagersten [13] These locks perform well on large machines, and require only ### # # # total space for # locks and # threads. Unfortunately, they require that a departing thread handshake with its neighbors in the queue in order ....
[Article contains additional citation context not shown here]
J. M. Mellor-Crummey and M. L. Scott. Algorithms for Scalable Synchronization on SharedMemory Multiprocessors. ACM Transactions on Computer Systems,9(1):21--65, February 1991.
A Steady State Analysis of Diffracting - Trees Nir Shavit (Correct)
No context found.
J.M. Mellor-Crummey and M.L. Scott. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. Technical Report 342, UniversityofRochester, Rochester, NY 14627, April 1990.
FAST: A Functionally Accurate Simulation Toolset for the.. - Cuvillo, Zhu, Hu, Gao (2005) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, February 1991.
Performance Characteristics of OpenMP Language Constructs on .. - Zhu, Cuvillo, Gao (2006) (Correct)
No context found.
Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on sharedmemory multiprocessors. ACM Transactions on Computer Systems 9(1) (1991) 21--65
Hybrid Transactional Memory - Sanjeev Kumar Michael (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, 1991.
Efficient Barrier and Allreduce on IBA clusters using.. - Mamidala, Liu, Panda (2004) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM ToCS, 9(1):21--65, 1991.
Efficient and Scalable Barrier over Quadrics and Myrinet - With New Nic-Based (2004) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, 1991.
A Parallel Communication Infrastructure for STAPL - Saunders, Rauchwerger (Correct)
No context found.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, 1991.
Permission to Make Digital Or Hard Copies of All Or Part.. - Personal Or Classroom (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, Feb. 1991.
Preliminary Investigation of Active Memory Operations - Zhang, Fang, Carter, Parker (2004) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. on Computer Systems, 9(1):21--65, Feb. 1991.
Scalable Room Synchronizations - Blelloch, Cheng, Gibbons (2003) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, Feb. 1991.
Enabling Scalable Performance for General Purpose.. - Appavoo.. (2003) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on sharedmemory multiprocessors. TOCS, 9(1):pp. 21--65, February 1991.
A Comparison of Software and Hardware Synchronization.. - Carter, Kuo, Kuramkote (1996) (9 citations) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. on Computer February 1991.
The System-on-a-Chip Lock Cache - Akgul (2004) (Correct)
No context found.
Mellor-Crummey, J. M. and Scott, M. L., "Algorithms for scalable synchronization on shared memory multiprocessors," ACM Transactions on Computer Systems, Vol. 9, pp. 21--65, February 1991.
Nonatomic Mutual Exclusion with Local Spinning (Extended.. - Anderson, Kim (2002) (2 citations) (Correct)
No context found.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21--65, February 1991.
Local-spin Mutual Exclusion Using Fetch-and-φ Primitives - Anderson, Kim (2003) (Correct)
No context found.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, February 1991.
An Improved Lower Bound for the Time Complexity of Mutual.. - Anderson, Kim (2002) (8 citations) (Correct)
No context found.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, February 1991.
PARLAK: Parametrized Lock Cache Synthesizer - Akgul, Mooney (2002) (Correct)
No context found.
J. M. Mellor-Crummey and M. L. Scott, "Algorithms for scalable synchronization on shared memory multiprocessors," ACM Transactions on Computer Systems, vol. 9, no. 1, pp. 21--65, February 1991.
Optimizing Synchronization Operations for Remote.. - Buntinas, Saify.. (Correct)
No context found.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-- 65, February 1991.
Efficient Object Sharing in Shared-Memory Multiprocessors - Moir (1996) (1 citation) (Correct)
No context found.
J. Mellor-Crummey and M. Scott, "Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors", ACM Transactions on Computer Systems , 9(1), 1991, pp. 21-65.
Appendix D - Detailed Proof Of (Correct)
No context found.
J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, February 1991.
First 50 documents
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