808 search results - page 4 / 162 » Data Communication and Parallel Computing on Twisted Hypercu... |
CLUSTER
2006
IEEE
13 years 12 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
ICPP
1994
IEEE
13 years 10 months ago
1994
IEEE
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
ICPP
1993
IEEE
13 years 10 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port model. In this mode...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...