1534 search results - page 3 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
COMPUTER
2002
13 years 5 months ago
2002
IPPS
2007
IEEE
14 years 7 days ago
2007
IEEE
Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
ICRA
2008
IEEE
14 years 11 days ago
2008
IEEE
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
NIXDORF
1992
13 years 10 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...