488 search results - page 37 / 98 » Using shared arrays in message-driven parallel programs |
PPOPP
1999
ACM
14 years 1 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
IPPS
1998
IEEE
14 years 29 days ago
1998
IEEE
Parallel programming on distributed memory systems is one of the most challenging research areas in parallel computingtoday. Objectbased parallel programming languages are an impor...
CAIP
1995
Springer
14 years 8 days 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...
ASPLOS
2011
ACM
13 years 9 days ago
2011
ACM
Deterministic replay systems record and reproduce the execution of a hardware or software system. In contrast to replaying execution on uniprocessors, deterministic replay on mult...
ICDT
2001
ACM
14 years 1 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...