221
click to vote
ICPP
15 years 11 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...
202
Voted
ICPP
15 years 11 months ago
1994 IEEE 
Both hardware and software prefetching have been shown to be e ective in tolerating the large memory latencies inherent in shared-memory multiprocessors however, both types of pre...
183
Voted
ICPP
15 years 11 months ago
1994 IEEE
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
183
Voted
ICPP
15 years 11 months ago
1994 IEEE 
We assert that in order to perform well, a shared-memory multiprocessorinter-process communication (IPC)facility mustavoid a) accessing any shared data, and b) acquiring any locks...
168
Voted
ICPP
15 years 11 months ago
1994 IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
|
Distributed And Parallel Computing