(Enter summary)
Abstract: To transform a sequential program into a concurrent program, a compiler typically divides
the sequential program into a partially-ordered set of basic blocks, allowing unrelated blocks
to execute concurrently. Blocks may execute concurrently only if there are no dependencies
among them, and therefore a compiler can introduce concurrency only to the extent that it
can guarantee the absence of dependencies. A limitation of this technique is that it is necessarily
conservative: it may be difficult ... (Update)
Active bibliography (related documents): More All
0.2: Dynamic Parallelization of Modifications to Directed Acyclic.. - Huelsbergen
(Correct)
0.1: Using the Run-Time Sizes of Data Structures to Guide.. - Huelsbergen, Larus.. (1994)
(Correct)
0.1: Static Dependent Costs for Estimating Execution Time - Brian Reistad David
(Correct)
Similar documents based on text: More All
0.2: Software Transactional Memory for Dynamic-Sized Data.. - Herlihy, Luchangco.. (2003)
(Correct)
0.1: A Tutorial on Algebraic Topology and Distributed Computation - Herlihy (1994)
(Correct)
0.1: Verification of the Randomized Consensus Algorithm of.. - Pogosyants, Segala.. (1997)
(Correct)
BibTeX entry: (Update)
@techreport{ greg93optimistic,
author = "Morrisett, Greg and Herlihy, Maurice",
title = "{O}ptimistic {P}arallelization",
number = "CMU-CS-93-171",
month = "October",
year = "1993",
url = "citeseer.ist.psu.edu/morrisett93optimistic.html" }
Citations (may not include all citations):
345
Notes on Database Operating Systems (context) - Gray - 1978
299
Dependence Analysis for Supercomputing (context) - Banerjee - 1988
246
On optimistic methods of concurrency control (context) - Kung, Robinson - 1981
241
A study of branch prediction strategies (context) - Smith - 1981
230
Limits of instruction-level parallelism
- Wall - 1991
189
A majority consensus approach to concurrency control for mul.. (context) - Thomas - 1979
157
Limits of control flow on parallelism
- Lam, Wilson - 1992
150
PROTEUS: A high-performance parallel architecture simulator
- Brewer, Dellarocas et al. - 1991
111
Using cache memory to reduce processor-memory traffic (context) - Goodman - 1983
84
Efficient and exact data dependence analysis (context) - Maydan, Hennessy et al. - 1991
79
Interprocedural dependence analysis and parallelization (context) - Burke, Cytron - 1986
70
The expandable split window paradigm for exploiting fine-gra..
- Franklin, Sohi - 1992
58
Dynamic dependency analysis of ordinary programs
- Austin, Sohi - 1992
29
The Art of Scientific Programming (context) - Press, in - 1988
26
An architecture for mostly functional languages (context) - Knight - 1986
21
Parallel execution of sequential Scheme with ParaTran (context) - Tinker, Katz - 1988
6
Dynamic program parallelization
- Huelsbergen, Larus - 1992
1
Practical methods for exact data dependency analysis (context) - Li, Yew - 1989
1
ParaTran: A transparent transaction based runtime mechanism ..
- Katz - 1989
1
Transactional memory: Architectural support for highly concu.. (context) - Herlihy, Moss - 1992
Documents on the same site (http://www2.cs.cornell.edu/faculty/home/jgm/home.html): More
TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995)
(Correct)
The TIL/ML Compiler: Performance and Safety through Types - Morrisett, Tarditi.. (1996)
(Correct)
Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (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