138 search results - page 10 / 28 » A Parallel Branch-and-Bound Algorithm for Computing Optimal ... |
PDP
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...
CCGRID
2008
IEEE
13 years 9 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...
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
HCW
2000
IEEE
13 years 12 months ago
2000
IEEE
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
ESCIENCE
2007
IEEE
14 years 1 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...