808 search results - page 89 / 162 » Data Communication and Parallel Computing on Twisted Hypercu... |
239
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
161
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
198
click to vote
ICS
1994
Tsinghua U.
15 years 10 months ago
1994
Tsinghua U.
This paper describes the design of a compiler which can translate out-of-core programs written in a data parallel language like HPF. Such a compiler is required for compiling larg...
176
click to vote
IEEEPACT
2005
IEEE
15 years 11 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
182
Voted
IJHPCA
2007
15 years 6 months ago
2007
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...