Automatic Parallelization With Statistical Accuracy Bounds
Traditional parallelizing compilers are designed to generate parallel programs that produce identical outputs as the original sequential program. The difficulty of performing the program analysis required to satisfy this goal and the restricted space of possible target parallel programs have both po...
Main Authors: | Kim, Deokhwan, Misailovic, Sasa, Rinard, Martin |
---|---|
Other Authors: | Martin Rinard |
Published: |
2010
|
Online Access: | http://hdl.handle.net/1721.1/51680 |
Similar Items
-
Parallelizing Sequential Programs With Statistical Accuracy Tests
by: Misailovic, Sasa, et al.
Published: (2010) -
Parallelizing Sequential Programs with Statistical Accuracy Tests
by: Misailovic, Sasa, et al.
Published: (2015) -
Synthesis of Randomized Accuracy-Aware Map-Fold Programs
by: Misailovic, Sasa, et al.
Published: (2013) -
Reasoning about Relaxed Programs
by: Carbin, Michael, et al.
Published: (2011) -
Proving acceptability properties of relaxed nondeterministic approximate programs
by: Carbin, Michael James, et al.
Published: (2012)