New Hybrid Algorithm for Task Scheduling in Grid Computing to Decrease missed Task

Main Authors: Z. Pooranian, A. Harounabadi, M. Shojafar, N. Hedayat
Format: Article eJournal
Bahasa: eng
Terbitan: , 2011
Online Access: https://zenodo.org/record/1332154
ctrlnum 1332154
fullrecord <?xml version="1.0"?> <dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><creator>Z. Pooranian</creator><creator>A. Harounabadi</creator><creator>M. Shojafar</creator><creator>N. Hedayat</creator><date>2011-07-28</date><description>The purpose of Grid computing is to utilize computational power of idle resources which are distributed in different areas. Given the grid dynamism and its decentralize resources, there is a need for an efficient scheduler for scheduling applications. Since task scheduling includes in the NP-hard problems various researches have focused on invented algorithms especially the genetic ones. But since genetic is an inherent algorithm which searches the problem space globally and does not have the efficiency required for local searching, therefore, its combination with local searching algorithms can compensate for this shortcomings. The aim of this paper is to combine the genetic algorithm and GELS (GAGELS) as a method to solve scheduling problem by which simultaneously pay attention to two factors of time and number of missed tasks. Results show that the proposed algorithm can decrease makespan while minimizing the number of missed tasks compared with the traditional methods.</description><identifier>https://zenodo.org/record/1332154</identifier><identifier>10.5281/zenodo.1332154</identifier><identifier>oai:zenodo.org:1332154</identifier><language>eng</language><relation>doi:10.5281/zenodo.1332153</relation><rights>info:eu-repo/semantics/openAccess</rights><rights>https://creativecommons.org/licenses/by/4.0/legalcode</rights><source>International Journal of Information, Control and Computer Sciences 4.0(7)</source><title>New Hybrid Algorithm for Task Scheduling in Grid Computing to Decrease missed Task</title><type>Journal:Article</type><type>Journal:Article</type><recordID>1332154</recordID></dc>
language eng
format Journal:Article
Journal
Journal:eJournal
author Z. Pooranian
A. Harounabadi
M. Shojafar
N. Hedayat
title New Hybrid Algorithm for Task Scheduling in Grid Computing to Decrease missed Task
publishDate 2011
url https://zenodo.org/record/1332154
contents The purpose of Grid computing is to utilize computational power of idle resources which are distributed in different areas. Given the grid dynamism and its decentralize resources, there is a need for an efficient scheduler for scheduling applications. Since task scheduling includes in the NP-hard problems various researches have focused on invented algorithms especially the genetic ones. But since genetic is an inherent algorithm which searches the problem space globally and does not have the efficiency required for local searching, therefore, its combination with local searching algorithms can compensate for this shortcomings. The aim of this paper is to combine the genetic algorithm and GELS (GAGELS) as a method to solve scheduling problem by which simultaneously pay attention to two factors of time and number of missed tasks. Results show that the proposed algorithm can decrease makespan while minimizing the number of missed tasks compared with the traditional methods.
id IOS17403.1332154
institution Universitas PGRI Palembang
institution_id 189
institution_type library:university
library
library Perpustakaan Universitas PGRI Palembang
library_id 587
collection Marga Life in South Sumatra in the Past: Puyang Concept Sacrificed and Demythosized
repository_id 17403
city KOTA PALEMBANG
province SUMATERA SELATAN
repoId IOS17403
first_indexed 2022-07-26T04:10:50Z
last_indexed 2022-07-26T04:10:50Z
recordtype dc
merged_child_boolean 1
_version_ 1739483502016987136
score 17.538404