Maged M. Michael, Michael L. Scott  Home/Search
Context Related
Links: ACM DBLP | rochester.edu/pub/...chronization.ps.gz rochester.edu/pub/u/mich...IPPS97.ps.gz rochester.edu/syst...chronization.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: bilkent.edu.tr/...ultiprogramming (more) From: rochester.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Most multiprocessors are multiprogrammed to achieve acceptable response time. 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. Non-blocking algorithms generally require a... (Update)
Context of citations to this paper: More
.... has been reported that such a blocking approach has a significant cost for many data structures such as queues, stacks, and heaps (see [MS97] and the papers cited there) More to the point, we ran some experiments to evaluate the relative performance of synchronized and...
...performance problems. They are easily applicable to simple data structures and have proven to be quite efficient under multiprogramming [10]. Unfortunately, they are based on universal atomic primitives which can atomically change the contents of short (typically up to 64 bits)...
Cited by: More
Fast Multi-Threading on Shared Memory Multiprocessors - Cordina (2000) (Correct)
Towards Scalable Multiprocessor Virtual Machines - Uhlig, LeVasseur, Skoglund.. (2004) (Correct)
The System-on-a-Chip Lock Cache - Akgul (2004) (Correct)
Similar documents (at the sentence level):
52.1%: Concurrent Update on Multiprogrammed Shared Memory.. - Michael, Scott (1996) (Correct)
36.9%: Non-Blocking Algorithms and Preemption-Safe Locking on.. - Michael, Scott (1998) (Correct)
Active bibliography (related documents): More All
0.4: Simple, Fast, and Practical Non-Blocking and Blocking.. - Michael, Scott (1996) (Correct)
0.1: Universal Operations: Unary versus Binary (Extended Abstract) - Attiya, Dagan (Correct)
0.1: Universal Operations: Unary Versus Binary - Dagan (1996) (Correct)
Similar documents based on text: More All
0.3: Scalable Spin Locks for Multiprogrammed Systems - Wisniewski, Kontothanassis.. (1994) (Correct)
0.2: On-line Algorithms for Path Selection in a Nonblocking Network - Arora, Leighton, Maggs (1994) (Correct)
0.2: A Novel Approach to Multiprogrammed Multiprocessor.. - Takada, Sakamura (1997) (Correct)
Related documents from co-citation: More All
9: Firstclass user-level threads - Marsh, Scott et al. - 1991
7: A Lock-Free Multiprocessor OS Kernel - Massalin, Pu - 1991
7: The Performance of Spin Lock Alternatives for Shared-memory Multiprocessors (context) - Anderson - 1990
BibTeX entry: (Update)
M. M. Michael and M. L. Scott, "Relative performance of preemption-safe locking and nonblocking synchronization on multiprogrammed shared memory multiprocessors," in Proc. 11th Int'l Parallel Processing Symposium, Apr. 1997. (to appear). http://citeseer.ist.psu.edu/michael97relative.html More
@inproceedings{ michaelrelative,
author = "M. Michael and M. Scott",
title = "Relative Performance of Preemption-Safe Locking and Non-Blocking Synchronization on Multiprogrammed Shared Memory Multiprocessors",
pages = "267--273",
url = "citeseer.ist.psu.edu/michael97relative.html" }
Citations (may not include all citations):304 Scheduler Activations: Effective Kernel Support for the User.. - Anderson, Bershad et al. - 1992 DBLP
186 A Methodology for Implementing Highly Concurrent Data Object.. - Herlihy ACM
102 Scheduling Support for Concurrency and Parallelism in the Ma.. - Black - 1990 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
33 on Programming Languages and Systems (context) - Herlihy, ACM - 1991
27 Performance Issues in Nonblocking Synchronization on Shared-.. (context) - Alemany, Felten - 1992
10 A Method for Implementing Lock-Free Data Structures (context) - Barnes - 1993
3 Axions for Concurrent Objects (context) - Herlihy, Wing - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ug.bcc.bilkent.edu.tr/~topkara/multiprogramming.html):
Scheduler-Conscious Synchronization - Kontothanassis, Wisniewski, Scott (1994) (Correct)
Processor Scheduling in Multiprogrammed Shared Memory NUMA.. - Wu (1993) (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