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

Cost and Energy Aware Scheduling Algorithm for Scientific Workflows with Deadline Constraint in Clouds - 2015

Cost and Energy Aware Scheduling Algorithm for Scientific Workflows with Deadline Constraint in Clouds

Research Area:  Cloud Computing

Abstract:

Cloud computing is a suitable platform to execute the deadline-constrained scientific workflows which are typical big data applications and often require many hours to finish. Moreover, the problem of energy consumption has become one of the major concerns in clouds. In this paper, we present a cost and energy aware scheduling (CEAS) algorithm for cloud scheduler to minimize the execution cost of workflow and reduce the energy consumption while meeting the deadline constraint. The CEAS algorithm consists of five sub-algorithms. First, we use the VM selection algorithm which applies the concept of cost utility to map tasks to their optimal virtual machine (VM) types by the sub-makespan constraint. Then, two tasks merging methods are employed to reduce execution cost and energy consumption of workflow. Further, In order to reuse the idle VM instances which have been leased, the VM reuse policy is also proposed. Finally, the scheme of slack time reclamation is utilized to save energy of leased VM instances. According to the time complexity analysis, we conclude that the time complexity of each sub-algorithm is polynomial. The CEAS algorithm is evaluated using Cloudsim and four real-world scientific workflow applications, which demonstrates that it outperforms the related well-known approaches.

Keywords:  

Author(s) Name:  Zhongjin Li; Jidong Ge; Haiyang Hu; Wei Song; Hao Hu; Bin Luo

Journal name:  IEEE Transactions on Services Computing

Conferrence name:  

Publisher name:  IEEE

DOI:  10.1109/TSC.2015.2466545

Volume Information:  Volume: 11, Issue: 4, July-Aug. 1 2018, Page(s): 713 - 726