Beng-Hong Lim  Home/Search
Context Related
| mit.edu/papers/reactive.ps.Z princeton.edu/pub/...eactivesynch.ps.Z ibm.com/people/l/lim/pa...reactive.ps.Z 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: mit.edu (more) From: ibm.com/people/l/lim/pubs (Enter author homepages) |
Rate this article:      (best)View Comments (0) |
Abstract: Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable run-time factors. The designer of a synchronization algorithm has a choice of protocols to use for implementing the synchronization operation. For example, candidate protocols for locks include test-and-set protocols and queueing protocols. Frequently, the best choice of protocols depends on the level of contention:... (Update)
Cited by: More
Lock Coarsening: Eliminating Lock Overhead in Automatically.. - Diniz, Rinard (1996) (Correct)
Permission to Make Digital Or Hard Copies of All Or Part.. - Personal Or Classroom (Correct)
A Comparison of Software and Hardware Synchronization.. - Carter, Kuo, Kuramkote (1996) (Correct)
Similar documents (at the sentence level):
25.3%: Reactive Synchronization Algorithms for Multiprocessors - Lim (1995) (Correct)
Active bibliography (related documents): More All
0.3: Waiting Algorithms for Synchronization in Large-Scale.. - Lim, Agarwal (1991) (Correct)
0.2: Achieving High Performance for Parallel Programs that Contain.. - Oyama (2000) (Correct)
0.1: The Performance of Concurrent Red-Black Tree Algorithms - Hanke (1998) (Correct)
Similar documents based on text: More All
0.2: Algorithms for Scalable Synchronization on Shared-Memory.. - Mellor-Crummey, Scott (1991) (Correct)
0.2: On Bounding Time and Space for Multiprocessor Garbage.. - Guy Blelloch Perry (1999) (Correct)
0.1: Parallel Communication Mechanisms for Sparse, Irregular Applications - Chong (Correct)
Related documents from co-citation: More All
17: Efficient Synchronization Primitives for LargeScale Cache-Coherent Multiprocesso.. (context) - GOODMAN, VERNON et al. - 1989
17: Empirical Studies of Competitive Spinning for a Shared-Memory Multiprocessor - Karlin, Li et al. - 1991
16: The Performance of Spin Lock Alternatives for Shared-memory Multiprocessors (context) - Anderson - 1990
BibTeX entry: (Update)
B.H. Lim and A. Agarwal, "Reactive synchronization algorithms for multiprocessors", ASPLOS, 1994 http://citeseer.ist.psu.edu/article/lim94reactive.html More
@inproceedings{ benghong94reactive,
author = "Lim, Beng-Hong and Agarwal, Anant",
title = "{R}eactive {S}ynchronization {A}lgorithms for {M}ultiprocessors",
booktitle = "Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems ({ASPLOS} {VI}),",
month = "October",
pages = "25--35",
year = "1994",
url = "citeseer.ist.psu.edu/article/lim94reactive.html" }
Citations (may not include all citations):595 Active Messages: A Mechanism for Integrated Communication an.. - von Eicken, Culler et al. - 1992
496 SPLASH: Stanford Parallel Applications for Shared-Memory (context) - Singh, Weber et al. - 1992
478 The Stanford Dash Multiprocessor (context) - Lenoski, Laudon et al. - 1992
362 The Stanford FLASH Multiprocessor (context) - Kuskin - 1994
268 Tempest and Typhoon: User-Level Shared Memory - Reinhardt, Larus et al. - 1994
239 Algorithms for Scalable Synchronization on Shared-Memory Mul.. (context) - Mellor-Crummey, Scott - 1991
191 The MIT Alewife Machine: A LargeScale Distributed-Memory Mul.. - Agarwal - 1991
170 LimitLESS Directories: A Scalable Cache Coherence Scheme - Chaiken, Kubiatowicz et al. - 1991
159 The NYU Ultracomputer -- Designing a MIMD Shared-Memory Para.. (context) - Gottlieb, Grishman et al. - 1983
112 Efficient Synchronization Primitives for Large-Scale CacheCo.. (context) - Goodman, Vernon et al. - 1989
102 Empirical Studies of Competitive Spinning for A Shared-Memor.. - Karlin, Li et al. - 1991
100 Competitive Algorithms for On-line Problems (context) - Manasse, McGeoch et al. - 1988
83 Basic Techniques for the Efficient Coordination of Very Larg.. - Gottlieb, Lubachevsky et al. - 1983
70 Dynamic Decentralized Cache Schemes for MIMD Parallel Proces.. (context) - Segall, Rudolph - 1984
57 Efficient Synchronization on Multiprocessors with Shared Mem.. - Kruskal, Rudolph et al. - 1988
21 Distributing Hot-Spot Addressing in Large-Scale Multiprocess.. (context) - Yew, Tzeng et al. - 1987
21 Synchronization Algorithms for Shared-Memory Multiprocessors (context) - Shreekant - 1990
19 Waiting Algorithms for Synchronization in Large-Scale Multip.. (context) - Lim, Agarwal - 1993
16 Vectorization of Monte-Carlo Particle Transport: An Architec.. (context) - Burns - 1989
6 The Performance Implications of Spin Lock Alternatives for S.. (context) - Anderson - 1990
1 Anatomy of a Message in the Alewife Multiprocessor - Anant - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cag.lcs.mit.edu.html): More
MGS: A Multigrain Shared Memory System - Yeung (1996) (Correct)
Dribbling Registers: A Mechanism for Reducing Context.. - Vijayaraghavan.. (1992) (Correct)
The Impact of Communication Locality on Large-Scale.. - Johnson (1992) (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