Memory constraint parallelised resource allocation and optimal scheduling using oppositional GWO for handling big data in cloud environment
by Chetana Tukkoji; K. Seetharam
International Journal of Cloud Computing (IJCC), Vol. 9, No. 4, 2020

Abstract: In cloud computing, task scheduling is one of the challenging troubles, especially when deadline and cost are conceived. On the other hand, the key issue of task scheduling is to reach optimal allocation of user's tasks in clouds. Besides, in terms of memory space and time complexities, the processing of a huge number of tasks with sequential algorithm results in greater computational cost. Therefore, we propose an efficient memory constraint parallelised resource allocation and optimal scheduling method based on oppositional GWO for resolving the scheduling problem of big data in the cloud environment in this paper. In parallel over distributed systems, the suggested scheduling approach applies the MapReduce framework to perform scheduling. The MapReduce framework is consisted of two main processes; particularly, the task prioritisation stage (with fuzzy C-means clustering method based on memory constraint) in map phase and optimal scheduling (using oppositional grey wolf optimisation algorithm) in reduce phase. The performance of proposed methodology is analysed in terms of makespan, cost and system utilisation.

Online publication date: Fri, 08-Jan-2021

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 Cloud Computing (IJCC):
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