1534 search results - page 158 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
108
Voted
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
104
click to vote
CCGRID
2005
IEEE
15 years 6 months ago
2005
IEEE
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
113
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
83
Voted
SPDP
1991
IEEE
15 years 4 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
116
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...