1074 search results - page 69 / 215 » Parallelizing post-placement timing optimization |
108
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
144
click to vote
PPOPP
2003
ACM
15 years 5 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
112
click to vote
PAAPP
1998
14 years 11 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
JSA
2000
14 years 11 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...