11 search results - page 1 / 3 » Automatic Data Decomposition for Message-Passing Machines |
LCPC
1997
Springer
13 years 8 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
TPDS
2002
13 years 4 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
ICS
2001
Tsinghua U.
13 years 9 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
SC
1995
ACM
13 years 8 months ago
1995
ACM
Given the large communication overheads characteristic of modern parallel machines, optimizations that eliminate, hide or parallelize communication may improve the performance of ...