Loading...
A genetic-based scheduling algorithm to minimize the makespan of the grid applications
Entezari Maleki, R ; Sharif University of Technology | 2010
573
Viewed
- Type of Document: Article
- DOI: 10.1007/978-3-642-17625-8_3
- Publisher: 2010
- Abstract:
- Task scheduling algorithms in grid environments strive to maximize the overall throughput of the grid. In order to maximize the throughput of the grid environments, the makespan of the grid tasks should be minimized. In this paper, a new task scheduling algorithm is proposed to assign tasks to the grid resources with goal of minimizing the total makespan of the tasks. The algorithm uses the genetic approach to find the suitable assignment within grid resources. The experimental results obtained from applying the proposed algorithm to schedule independent tasks within grid environments demonstrate the applicability of the algorithm in achieving schedules with comparatively lower makespan in comparison with other well-known scheduling algorithms such as, Min-min, Max-min, RASA and Sufferage algorithms
- Keywords:
- grid environment ; Task scheduling ; Genetic approach ; Grid applications ; Grid environments ; Grid resource ; Independent tasks ; Makespan ; Max-min ; Task-scheduling algorithms ; Genetic algorithms ; Grid computing ; Information technology ; Mesh generation ; Multitasking ; Scheduling algorithms
- Source: Communications in Computer and Information Science, 13 December 2010 through 15 December 2010 ; Volume 121 CCIS , December , 2010 , Pages 22-31 ; 18650929 (ISSN) ; 9783642176241 (ISBN)
- URL: http://link.springer.com/chapter/10.1007%2F978-3-642-17625-8_3