6004 search results - page 702 / 1201 » Parallelizing query optimization |
163
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
132
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
120
Voted
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
Some of the most challenging applications to parallelize scalably are the ones that present a relatively small amount of computation per iteration. Multiple interacting performance...
131
click to vote
IEEEPACT
1999
IEEE
15 years 9 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
143
Voted
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...