6004 search results - page 392 / 1201 » Parallelizing query optimization |
147
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
105
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
196
click to vote
FTDCS
1997
IEEE
15 years 11 months ago
1997
IEEE
: This paper discusses the issues and promising approaches in (1) obtaining rigorous specifications of the quality-of-service (QoS) requirements associated with application functio...
172
click to vote
ICDCS
1996
IEEE
15 years 11 months ago
1996
IEEE
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
157
Voted
CLUSTER
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we discuss issues related to the highperformance implementation of collective communications operations on distributed-memory computer architectures. Using a combina...