(Enter summary)
Abstract: Efficient synchronization algorithms are hard to design because their performance depends
on run-time factors that are hard to predict. In particular, the designer has a choice of protocols
to implement the synchronization operation, and a choice of waiting mechanisms to wait for
synchronization delays. Frequently, the right choice depends on run-time factors such as contention
and waiting time. As a solution, this thesis investigates reactive synchronization algorithms that
dynamically select ... (Update)
Similar documents based on text: More All
1.2: Waiting Algorithms for Synchronization in Large-Scale.. - Lim, Agarwal (1991)
(Correct)
0.5: QuickStep: A System for Performance Monitoring and Debugging.. - Mitra (1995)
(Correct)
0.2: Compiler Analysis to Implement Point-to-Point Synchronization in.. - Nguyen (1993)
(Correct)
BibTeX entry: (Update)
B.H. Lim and A. Agarwal, "Reactive synchronization algorithms for multiprocessors", ASPLOS, 1994 http://citeseer.ist.psu.edu/lim95reactive.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/lim95reactive.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
326
Linearizability: A Correctness Condition for Concurrent Obje.. (context) - Herlihy, Wing - 1988
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
234
Competitive Snoopy Caching (context) - Karlin, Manasse et al. - 1988
220
ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1986
212
APRIL: A Processor Architecture for Multiprocessing
- Agarwal, Lim et al. - 1990
198
Scheduling Techniques for Concurrent Systems (context) - Ousterhout - 1982
191
The MIT Alewife Machine: A Large-Scale Distributed-Memory Mu..
- Agarwal - 1991
181
ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
170
LimitLESS Directories: A Scalable Cache Coherence Scheme
- Chaiken, Kubiatowicz et al. - 1991
164
The Network Architecture of the Connection Machine CM
- Leiserson - 1992
[Article contains additional citations not shown here]
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
Reactive Synchronization Algorithms for Multiprocessors - Lim (1994)
(Correct)
MGS: A Multigrain Shared Memory System - Yeung (1996)
(Correct)
Dribbling Registers: A Mechanism for Reducing Context.. - Vijayaraghavan.. (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