Sciweavers

417 search results - page 57 / 84
» From patterns to frameworks to parallel programs
Sort
View
CONCUR
2006
Springer
15 years 5 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
FASE
2005
Springer
15 years 7 months ago
Improving System Understanding via Interactive, Tailorable, Source Code Analysis
In situations in which developers are not familiar with a system or its documentation is inadequate, the system’s source code becomes the only reliable source of information. Unf...
Vladimir Jakobac, Alexander Egyed, Nenad Medvidovi...
112
Voted
IEEEPACT
2009
IEEE
15 years 8 months ago
Data Layout Transformation for Enhancing Data Locality on NUCA Chip Multiprocessors
—With increasing numbers of cores, future CMPs (Chip Multi-Processors) are likely to have a tiled architecture with a portion of shared L2 cache on each tile and a bankinterleave...
Qingda Lu, Christophe Alias, Uday Bondhugula, Thom...
CAV
2008
Springer
131views Hardware» more  CAV 2008»
15 years 3 months ago
Validating High-Level Synthesis
The growing design-productivity gap has made designers shift toward using high-level languages like C, C++ and Java to do system-level design. High-Level Synthesis (HLS) is the pro...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
ISHPC
2000
Springer
15 years 5 months ago
Leveraging Transparent Data Distribution in OpenMP via User-Level Dynamic Page Migration
This paper describes transparent mechanisms for emulating some of the data distribution facilities offered by traditional data-parallel programming models, such as High Performance...
Dimitrios S. Nikolopoulos, Theodore S. Papatheodor...