Sciweavers

26 search results - page 1 / 6
» All-du-path Coverage for Parallel Programs
Sort
View
ISSTA
1998
ACM
13 years 9 months ago
All-du-path Coverage for Parallel Programs
Cheer-Sun D. Yang, Amie L. Souter, Lori L. Pollock
HPDC
2008
IEEE
13 years 5 months ago
Code coverage, performance approximation and automatic recognition of idioms in scientific applications
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
Jiahua He, Allan Snavely, Rob F. Van der Wijngaart...
DCOSS
2009
Springer
13 years 11 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
ICS
2003
Tsinghua U.
13 years 10 months ago
Selecting long atomic traces for high coverage
This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and...
Roni Rosner, Micha Moffie, Yiannakis Sazeides, Ron...
HPCA
2008
IEEE
14 years 5 months ago
Supporting highly-decoupled thread-level redundancy for parallel programs
The continued scaling of device dimensions and the operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can p...
M. Wasiur Rashid, Michael C. Huang