Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • pro@slogix.in
  • +91- 81240 01111

Social List

A review of task scheduling based on meta-heuristics approach in cloud computing - 2017

A review of task scheduling based on meta-heuristics approach in cloud computing

Research Area:  Cloud Computing

Abstract:

Heterogeneous distributed computing systems are the emerging for executing scientific and computationally intensive applications. Cloud computing in this context describes a paradigm to deliver the resource-like computing and storage on-demand basis using pay-per-use model. These resources are managed by data centers and dynamically provisioned to the users based on their availability, demand and quality parameters required to be satisfied. The task scheduling onto the distributed and virtual resources is a main concern which can affect the performance of the system. In the literature, a lot of work has been done by considering cost and makespan as the affecting parameters for scheduling the dependent tasks. Prior work has discussed the various challenges affecting the performance of dependent task scheduling but did not consider storage cost, failure rate-related challenges. This paper accomplishes a review of using meta-heuristics techniques for scheduling tasks in cloud computing. We presented the taxonomy and comparative review on these algorithms. Methodical analysis of task scheduling in cloud and grid computing is presented based on swarm intelligence and bio-inspired techniques. This work will enable the readers to decide suitable approach for suggesting better schemes for scheduling users application. Future research issues have also been suggested in this research work.

Keywords:  

Author(s) Name:  Poonam Singh, Maitreyee Dutta & Naveen Aggarwal

Journal name:  Knowledge and Information Systems

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s10115-017-1044-2

Volume Information:  volume 52, pages 1–51 (2017)