1257 search results - page 17 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
WDAG
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
1 The communication cost plays a key role in the performance of many parallel algorithms. In the particular case of the one-sided Jacobi method for symmetric eigenvalue and eigenve...
121
click to vote
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
SPAA
1990
ACM
15 years 1 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
105
click to vote
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...