Teaching learning-based optimisation for job scheduling in computational grids
by Tarun Kumar Ghosh; Sanjoy Das
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 21, No. 1/2, 2022

Abstract: Grid computing is a framework that enables the sharing, selection and aggregation of geographically distributed resources dynamically to meet the current and growing computational demands. Job scheduling is a key issue of grid computing and its algorithm has a direct effect on the performance of the whole system. Because of distributed heterogeneous nature of resources, the job scheduling in computational grid is an NP-complete problem. Thus, the use of meta-heuristic is more appropriate option in obtaining optimal results. In this paper, a recently developed optimisation algorithm known as teaching learning-based optimisation (TLBO) is proposed to solve job scheduling problem in computational Grid system with minimisation of makespan, processing cost and job failure rate, and maximisation of resource utilisation criteria. In order to measure the efficacy of proposed TLBO, genetic algorithm (GA), particle swarm optimisation (PSO), firefly algorithm (FA) and differential evolution (DE) are considered for comparison. The comparative results exhibit that the proposed TLBO technique outperforms other algorithms.

Online publication date: Wed, 23-Feb-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com