16128 search results - page 155 / 3226 » Distributed network scheduling |
119
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
108
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
121
click to vote
ICS
1995
Tsinghua U.
15 years 6 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
123
click to vote
AAAI
2007
15 years 5 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
159
click to vote
CCGRID
2008
IEEE
15 years 4 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...