A Task Duplication Based Efficient Multi-Objective Grid Workflow Scheduling Algorithm
Main Article Content
Abstract
Grid computing facilitates global infrastructure for user to consume the services over the network. To achieve the promising potentials of enormous distributed resources, effective and efficient scheduling algorithms have to be used. Most of the parallel applications in grid computing fall into interdependent task model called workflow. Grid workflow scheduling represented by Directed Acyclic Graph (DAG) is a typical NP-Complete problem. The performance of the workflow scheduling is based on efficient scheduling. Scheduling is a process that maps and manages the execution of interdependent tasks on the distributed resources. In this paper, a new algorithm, named Task Duplication Based Efficient Multi-Objective Scheduling (TDB-EMOS) algorithm is proposed to satisfy multi objective functions. It maximizes the resource utilization in a grid, minimizes makespan and communication cost/time by reserving the resources in advance and schedules the task on priority. The proposed algorithm has been implemented with arbitrary task graphs and application graphs in a simulated environment. The results are compared with the well known Min-Min, HEFT, EDOS (Efficient Dual Objective Scheduling) and EDS-G (Economical Duplication Scheduling in grid) scheduling algorithms and showing that the proposed algorithm is yielding better results.
Keywords: Grid Computing; DAG; Workflow scheduling; Heterogeneous systems; Parallel processing.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.