An effective compaction strategy for bi-criteria DAG scheduling in grids

Authors:
Amit Agarwal;Padam Kumar
Affiliations:
Department of Electronics & Computer Engineering, Indian Institute of Technology Roorkee, Roorkee 247 667, Uttarakhand, India.;Department of Electronics & Computer Engineering, Indian Institute of Technology Roorkee, Roorkee 247 667, Uttarakhand, India
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2010

Citing 13
Cited 0

Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Economic Scheduling in Grid Computing

JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs

Journal of Parallel and Distributed Computing
Biobjective Scheduling Algorithms for Execution Time–Reliability Trade-off in Heterogeneous Computing Systems*

The Computer Journal
Cost-Based Scheduling of Scientific Workflow Application on Utility Grids

E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Utility-based QoS optimisation strategy for multi-criteria scheduling on the grid

Journal of Parallel and Distributed Computing
Bi-criteria Scheduling of Scientific Workflows for the Grid

CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms

Scientific Programming - Scientific Workflows
Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling

IEEE Transactions on Parallel and Distributed Systems
Scheduling workflow applications on processors with different capabilities

Future Generation Computer Systems - Collaborative and learning applications of grid technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bi-criteria scheduling approach may require several different criteria to be considered simultaneously when evaluating the quality of solution or a schedule. In general, scheduling directed acyclic graph (DAG) in grid occupies large number of computing resources or processors. To address this problem, we present an effective bi-criteria scheduling heuristic called 'schedule optimisation with duplication-based bi-criteria scheduling algorithm' (SODA). The proposed approach comprises two stages: 1) duplication-based scheduling – optimises the primary criterion, i.e., execution time; 2) compaction of schedules – minimises the processor requirements and optimises secondary criterion, i.e., economic cost without increasing the makespan obtained in primary scheduling. The experimental results reveal that the proposed approach generates schedules with low processor requirements which are fairly optimised for both economic cost and makespan for executing DAG applications in the grid environments.