Optimization grid scheduling with priority base and bees algorithm

Grid computing depends upon sharing large-scales in a network that is widely connected within itself such as the Internet. Therefore, many grid computing researchers and scholars have focused on task scheduling, which is considered one of the NP-Complete issues. The main aim of this current research...

Full description

Saved in:
Bibliographic Details
Main Author: Ahmed, Mohammed Shihab
Format: Thesis
Language:en
en
Published: 2014
Subjects:
Online Access:https://etd.uum.edu.my/4381/1/s814591.pdf
https://etd.uum.edu.my/4381/2/s814591_abstract.pdf
https://etd.uum.edu.my/4381/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1833436299661410304
author Ahmed, Mohammed Shihab
author_facet Ahmed, Mohammed Shihab
author_sort Ahmed, Mohammed Shihab
building UUM Library
collection Institutional Repository
content_provider Universiti Utara Malaysia
content_source UUM Electronic Theses
continent Asia
country Malaysia
description Grid computing depends upon sharing large-scales in a network that is widely connected within itself such as the Internet. Therefore, many grid computing researchers and scholars have focused on task scheduling, which is considered one of the NP-Complete issues. The main aim of this current research to propose an optimization of the initial scheduler for grid computing using the bees algorithm. Modern algorithms informed this research. The suggested procedure means that a newly developed algorithm can implement the schedule grid task while accounting for priorities and deadlines to decrease the completion time required for the tasks. The average waiting time of the grid environment can be minimized, and this minimization, in turn, creates an increase in the throughput of the environment.
format Thesis
id my.uum.etd-4381
institution Universiti Utara Malaysia
language en
en
publishDate 2014
record_format eprints
spelling my.uum.etd-43812022-04-09T23:18:24Z https://etd.uum.edu.my/4381/ Optimization grid scheduling with priority base and bees algorithm Ahmed, Mohammed Shihab QA76 Computer software Grid computing depends upon sharing large-scales in a network that is widely connected within itself such as the Internet. Therefore, many grid computing researchers and scholars have focused on task scheduling, which is considered one of the NP-Complete issues. The main aim of this current research to propose an optimization of the initial scheduler for grid computing using the bees algorithm. Modern algorithms informed this research. The suggested procedure means that a newly developed algorithm can implement the schedule grid task while accounting for priorities and deadlines to decrease the completion time required for the tasks. The average waiting time of the grid environment can be minimized, and this minimization, in turn, creates an increase in the throughput of the environment. 2014 Thesis NonPeerReviewed text en https://etd.uum.edu.my/4381/1/s814591.pdf text en https://etd.uum.edu.my/4381/2/s814591_abstract.pdf Ahmed, Mohammed Shihab (2014) Optimization grid scheduling with priority base and bees algorithm. Masters thesis, Universiti Utara Malaysia.
spellingShingle QA76 Computer software
Ahmed, Mohammed Shihab
Optimization grid scheduling with priority base and bees algorithm
title Optimization grid scheduling with priority base and bees algorithm
title_full Optimization grid scheduling with priority base and bees algorithm
title_fullStr Optimization grid scheduling with priority base and bees algorithm
title_full_unstemmed Optimization grid scheduling with priority base and bees algorithm
title_short Optimization grid scheduling with priority base and bees algorithm
title_sort optimization grid scheduling with priority base and bees algorithm
topic QA76 Computer software
url https://etd.uum.edu.my/4381/1/s814591.pdf
https://etd.uum.edu.my/4381/2/s814591_abstract.pdf
https://etd.uum.edu.my/4381/
url_provider http://etd.uum.edu.my/