Research on Optimization of Dependent Tasks Scheduling Algorithm in Cloud

An efficient and inexpensive dependent task scheduling algorithm is proposed in this paper which is based on a Directed Acyclic Graph. Firstly, the task prioritizes estimates from bottom to top. Secondly, top-bottom task priority estimate is based on the results of the first estimate; while adding a priority to be more explicit of the estimates of the tasked priority, the key tasks can be performed as early as possible and can effectively shorten a scheduling length while optimizing the dependent tasks execution costs in the cloud. Experimental results show compared algorithms of HEFT. CPOP, and DPS with OADTS. It increased by 10% in terms of time efficiency and the execution costs decreased by 7%, which is an efficient and inexpensive scheduling method for dependent tasks in the cloud environment.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 1683-1690
  • Monograph Title: CICTP 2014: Safe, Smart, and Sustainable Multimodal Transportation Systems

Subject/Index Terms

Filing Info

  • Accession Number: 01532365
  • Record Type: Publication
  • ISBN: 9780784413623
  • Files: TRIS, ASCE
  • Created Date: Jul 31 2014 9:01AM