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.
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784413623
-
Supplemental Notes:
- © 2014 American Society of Civil Engineers.
-
Corporate Authors:
American Society of Civil Engineers
1801 Alexander Bell Drive
Reston, VA United States 20191-4400 -
Authors:
- Liu, Yanpei
- Li, Chunlin
- Yang, Zhiyong
- Xu, Lijun
-
Conference:
- 14th COTA International Conference of Transportation Professionals
- Location: Changsha , China
- Date: 2014-7-4 to 2014-7-7
- Publication Date: 2014-6
Language
- 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
- TRT Terms: Algorithms; Cloud computing; Experiments; Optimization; Scheduling; Task analysis
- Subject Areas: Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning;
Filing Info
- Accession Number: 01532365
- Record Type: Publication
- ISBN: 9780784413623
- Files: TRIS, ASCE
- Created Date: Jul 31 2014 9:01AM