Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids

Authors:
Tomasz Szepieniec;Marian Bubak
Affiliations:
Academic Computer Centre CYFRONET AGH, Kraków, Poland 30-950;Academic Computer Centre CYFRONET AGH, Kraków, Poland 30-950 and Institute of Computer Science, AGH, Kraków, Poland 30-059
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Year:
2008

Citing 10
Cited 0

On the complexity of list scheduling algorithms for distributed-memory systems

ICS '99 Proceedings of the 13th international conference on Supercomputing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
On Scheduling Mesh-Structured Computations for Internet-Based Computing

IEEE Transactions on Computers
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing

IEEE Transactions on Computers
Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids

SBAC-PAD '05 Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing
Toward a Theory for Scheduling Dags in Internet-Based Computing

IEEE Transactions on Computers
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality

IEEE Transactions on Parallel and Distributed Systems
A Comparison of robustness metrics for scheduling DAGs on heterogeneous systems

CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
Scheduling workflow applications on processors with different capabilities

Future Generation Computer Systems - Collaborative and learning applications of grid technology
A joint data and computation scheduling algorithm for the grid

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Among many attempts to design DAG scheduling algorithms that would face grid environment requirements, the strategy of number of eligible jobs maximization seems promising. Therefore, this paper presents the results of thorough analysis and evaluation of this strategy and its implementation called PRIO. We have analysed a large space of random DAGs and various resources parameters to compare results of PRIO algorithm with standard critical path length prioritization, FIFO prioritization as well as with quasi-optimal solution. Results of this comparison, in terms of the makespan and robustness, are supplemented by a theoretical and specific case analysis. We conclude with an assessment of usefulness of the current implementation of eligible jobs maximization strategy.