839 search results - page 49 / 168 » Communication Optimizations for Parallel Computing Using Dat... |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
DEXA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
PPOPP
1999
ACM
13 years 12 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
USENIX
1996
13 years 9 months ago
1996
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
CLADE
2004
IEEE
13 years 11 months ago
2004
IEEE
A key challenge faced by large-scale, distributed applications in Grid environments is efficient, seamless data management. In particular, for applications that can benefit from a...