7092 search results - page 292 / 1419 » Parallelizing constraint programs |
205
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
We describe a framework for better understanding scheduling policies for fine-grained parallel computations and their effect on space usage. We define a profiling semantics that c...
108
click to vote
PPAM
2005
Springer
15 years 8 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
118
click to vote
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
119
click to vote
PDP
2008
IEEE
15 years 9 months ago
2008
IEEE
Parallel programming models based on a mixture of task and data parallelism have shown to be successful in addressing the increasing communication overhead of distributed memory p...
129
click to vote
CAIP
1995
Springer
15 years 6 months ago
1995
Springer
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...