Maged M. Michael, Michael L. Scott  Home/Search
Context Related
| rochester.edu/pub/u/mich...JPDC98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rochester.edu/u/michael/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Most multiprocessors are multiprogrammed in order to achieve acceptable response time and to increase their utilization. Unfortunately, inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for concurrent, atomic update of shared data structures: (1) preemption-safe locking and (2) non-blocking (lock-free) algorithms. Preemption-safe locking requires kernel support.... (Update)
Cited by: More
Preemption Adaptivity in Time-Published Queue-Based Spin Locks - He, III, Scott (2005) (Correct)
Temporal Inventory and Real-Time Synchronization in - Rtlinuxpro Victor Yodaiken (Correct)
A Comparison of Task Pools for Synamic Load Balancing of.. - Korch, Rauber (Correct)
Similar documents (at the sentence level):
25.8%: Concurrent Update on Multiprogrammed Shared Memory.. - Michael, Scott (1996) (Correct)
20.0%: Relative Performance of Preemption-Safe Locking and.. - Michael, Scott (1997) (Correct)
13.7%: Simple, Fast, and Practical Non-Blocking and Blocking.. - Michael, Scott (1996) (Correct)
Active bibliography (related documents): More All
1.8: Non-Blocking Algorithms and Preemption-Safe Locking on.. - Michael, Scott (1998) (Correct)
0.7: Implementing Lock-Free Queues - Valois (1994) (Correct)
0.5: Improving Wait-Free Algorithms for Interprocess.. - Huang, Pillai, Shin (2002) (Correct)
Similar documents based on text: More All
0.3: Scalable Spin Locks for Multiprogrammed Systems - Wisniewski, Kontothanassis.. (1994) (Correct)
0.3: Fast Mutual Exclusion, Even With Contention - Michael, Scott (1993) (Correct)
0.2: On-line Algorithms for Path Selection in a Nonblocking Network - Arora, Leighton, Maggs (1994) (Correct)
Related documents from co-citation: More All
9: The SPLASH-2 programs: Characterization and methodological considerations - Woo, Ohara et al. - 1995
8: ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
7: The SGI Origin: A ccNUMA Highly Scalable Server (context) - Laudon, Lenoski - 1997
BibTeX entry: (Update)
M. Michael and M. Scott, Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors, Journal of Parallel and Distributed Computing, Vol. 54(2), pp. 162--182, 1998. http://citeseer.ist.psu.edu/michael98nonblocking.html More
@article{ michael98nonblocking,
author = "Maged M. Michael and Michael L. Scott",
title = "Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared --- Memory Multiprocessors",
journal = "Journal of Parallel and Distributed Computing",
volume = "51",
number = "1",
pages = "1--26",
year = "1998",
url = "citeseer.ist.psu.edu/michael98nonblocking.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Program - 1983
326 Linearizability: A Correctness Condition for Concurrent Obje.. (context) - Herlihy, Wing - 1990 ACM DBLP
304 Scheduler Activations: Effective Kernel Support for the User.. - Anderson, Bershad et al. - 1992
239 Algorithms for Scalable Synchronization on Shared-Memory Mul.. (context) - Mellor-Crummey, Scott - 1991
198 Scheduling Techniques for Concurrent Systems (context) - Ousterhout - 1982
197 The Performance of Spin Lock Alternatives for Shared-Memory .. (context) - Anderson - 1990
186 A Methodology for Implementing Highly Concurrent Data Object.. - Herlihy - 1993 ACM
181 ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
142 High Performance Computer Architecture (context) - Stone - 1993
115 First-Class User-Level Threads - Marsh, Scott et al. - 1991 ACM
113 Computer Architecture and Parallel Processing (context) - Hwang, Briggs - 1984 ACM
102 Scheduling Support for Concurrency and Parallelism in the Ma.. - Black - 1990
102 Empirical Studies of Competitive Spinning for a SharedMemory.. - Karlin, Li et al. - 1991
83 Basic Techniques for the Efficient Coordination of Very Larg.. - Gottlieb, Lubachevsky et al. - 1983 ACM DBLP
61 A Lock-Free Multiprocessor OS Kernel - Massalin, Pu - 1991 ACM
61 Software Transactional Memory - Shavit, Touitou - 1995
51 Axioms for Concurrent Objects (context) - Herlihy, Wing - 1987
51 Universal Constructions for Multi-Object Operations - Anderson, Moir - 1995
40 The Effect of Scheduling Discipline on Spin Overhead in Shar.. (context) - Zahorjan, Lazowska et al. - 1991 ACM DBLP
37 Process Management for Highly Parallel UNIX Systems (context) - Edler, Lipkis et al. - 1988
36 Wait-Free Parallel Algorithms for the Union-Find Problem - Anderson, Woll - 1991 ACM DBLP
35 Lock-Free Linked Lists Using Compare-and-Swap - Valois - 1995 ACM DBLP
31 Locking Without Blocking: Making Lock Based Concurrent Data .. (context) - Turek, Shasha et al. - 1992 DBLP
31 Rensselaer Polytechnic Institute (context) - Valois, Structures et al. - 1995
28 A New Approach to Exclusive Data Access in Shared Memory Mul.. (context) - Jensen, Hagensen et al. - 1987
27 Performance Issues in Non-blocking Synchronization on Shared.. (context) - Alemany, Felten - 1992 ACM DBLP
26 Scheduler-Conscious Synchronization - Kontothanassis, Wisniewski et al. - 1997 ACM DBLP
25 and Practical Non-Blocking and Blocking Concurrent Queue Alg.. (context) - Michael, Scott et al. - 1996
24 A Nonblocking Algorithm for Shared Queues Using Compare-and-.. (context) - Prakash, Lee et al. - 1994 ACM DBLP
21 Implementing Lock-Free Queues - Valois - 1994
17 Systems Programming: Coping with Parallelism (context) - Treiber - 1986
15 A Fair Fast Scalable Reader-Writer Lock - Krieger, Stumm et al. - 1993
15 Relative Performance of Preemption-Safe Locking and Non-Bloc.. - Michael, Scott - 1997 ACM DBLP
12 Correction of a Memory Management Method for Lock-Free Data .. - Michael, Scott - 1995 ACM
10 A Method for Implementing Lock-Free Data Structures (context) - Barnes - 1993
9 Non-Blocking Algorithms for Concurrent Data Structures - Prakash, Lee et al. - 1991
8 A Simple and Correct Shared-Queue Algorithm Using Compare-an.. (context) - Stone - 1990 ACM DBLP
8 A Performance Evaluation of Lock-free Synchronization Protoc.. (context) - LaMarca - 1994 ACM DBLP
6 Implementation of General-Purpose Atomic Primitives for Dist.. (context) - Michael, Scott - 1995
6 IEEE Parallel and Distributed Technology (context) - Stone, Stone et al. - 1993
5 A Non-Blocking Compare-and-Swap Algorithm for a Shared Circu.. (context) - Stone - 1992
4 Operating Systems and Computer Architecture (context) - Sites - 1980
2 Concurrent Queues: Practical Fetch-and-F Algorithms (context) - Mellor-Crummey - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rochester.edu/u/michael/): More
Correction of a Memory Management Method for Lock-Free Data.. - Michael, Scott (1995) (Correct)
Relative Performance of Preemption-Safe Locking and.. - Michael, Scott (1997) (Correct)
Implementation of Atomic Primitives on Distributed Shared.. - Maged Michael (1995) (Correct)
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