Sciweavers

85 search results - page 11 / 17
» Speculation for Parallelizing Runtime Checks
Sort
View
RV
2010
Springer
152views Hardware» more  RV 2010»
13 years 5 months ago
Efficient Data Race Detection for Async-Finish Parallelism
One of the major productivity hurdles for parallel programming is non-determinism -- a parallel program may yield different results on different executions with the same input, dep...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
EUROPAR
2007
Springer
14 years 1 months ago
Auto-parallelisation of Sieve C++ Programs
We describe an approach to automatic parallelisation of programs written in Sieve C++ (Codeplay’s C++ extension), using the Sieve compiler and runtime system. In Sieve C++, the p...
Alastair F. Donaldson, Colin Riley, Anton Lokhmoto...
ICFP
2007
ACM
14 years 7 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
CONCUR
2003
Springer
14 years 15 days ago
Model Checking a Path
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
Nicolas Markey, Ph. Schnoebelen
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner