901 search results - page 171 / 181 » Hiding Communication Latency in Data Parallel Applications |
82
Voted
ISCA
2000
IEEE
15 years 4 months ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
102
Voted
PC
2002
15 years 19 hour ago
2002
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
98
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
126
Voted
ASPLOS
1996
ACM
15 years 4 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
110
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...