Sciweavers

678 search results - page 38 / 136
» Lock-free parallel dynamic programming
Sort
View
120
Voted
POPL
1998
ACM
15 years 7 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
125
Voted
ICS
2007
Tsinghua U.
15 years 9 months ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 4 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
137
Voted
IPPS
2010
IEEE
15 years 1 months ago
Towards dynamic reconfigurable load-balancing for hybrid desktop platforms
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
Alécio Pedro Delazari Binotto, Carlos Eduar...
ICPP
1996
IEEE
15 years 7 months ago
Mechanisms for Mapping High-Level Parallel Performance Data
A primary problem in the performance measurement of high-level parallel programming languages is to map lowlevel events to high-level programming constructs. We discuss several as...
R. Bruce Irvin, Barton P. Miller