678 search results - page 4 / 136 » Lock-free parallel dynamic programming |
SPDP
1992
IEEE
15 years 3 months ago
1992
IEEE
108
click to vote
PC
2012
13 years 7 months ago
2012
This paper describes a safe and efficient combination of the object-based message-driven execution and shared array parallel programming models. In particular, we demonstrate how ...
124
click to vote
PPOPP
2011
ACM
14 years 2 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Parallel programs are known to be difficult to analyze. A key reason is that they typically have an enormous number of execution interleavings, or schedules. Static analysis over...