In accordance with regulations and requirements, the editorial department's website domain has been changed to arocmag.cn. The original domain (arocmag.com) will be discontinued after Dec. 31st, 2024.
See More
Algorithm Research & Explore
|
App. Res. of Comp. Printed Article
Vol. 40, 2023 No. 1
172-177,184

Cost optimization algorithm based on dynamic allocation of deadline for workflow scheduling in clouds

Pan Jikui1,2
Dong Xinyi1,2
Wang Zijian1
Lu Zhenghao1,2
Sun Fuquan1
1. School of Mathematics & Statistics, Northeastern University at Qinhuangdao, Qinhuangdao Hebei 066000, China
2. College of Information Science & Engineering, Northeastern University, Shenyang 110000, China
DOI: 10.19734/j.issn.1001-3695.2022.06.0292

Abstract

Nowadays, how to reduce the execution cost of workflow under the premise of meeting the deadline constraint is one of the main problems of workflow scheduling in cloud. A three-step list scheduling algorithm can solve this problem effectively. However, the algorithm can only form static sub-deadline in deadline allocation stage. To provide convenience for users to deploy workflow tasks, cloud service providers provide users with three types of instances. Among them, spot instance has great price advantage and can greatly reduce the execution cost of workflow. To solve the above problems, this paper proposed a cost optimization algorithm based on dynamic allocation of deadline for workflow scheduling(S-DTDA). This algorithm used particle swarm optimization to dynamically allocate the deadline, which made up for the defect of the three-step list scheduling algorithm. In the virtual machine selection stage, the algorithm added the spot instance to the candidate resources, which greatly reduced the execution cost. Experimental results show that compared with other classical algorithms, this algorithm has obvious advantages in experimental success rate and execution cost. In conclusion, S-DTDA algorithm can effectively solve the cost optimization problem of deadline constraint in workflow scheduling.

Foundation Support

国家重点研发计划资助项目(2018YFB1402800)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2022.06.0292
Publish at: Application Research of Computers Printed Article, Vol. 40, 2023 No. 1
Section: Algorithm Research & Explore
Pages: 172-177,184
Serial Number: 1001-3695(2023)01-028-0172-06

Publish History

[2022-08-30] Accepted Paper
[2023-01-05] Printed Article

Cite This Article

潘纪奎, 董心仪, 王子健, 等. 云中截止时间动态分配的工作流调度成本优化算法 [J]. 计算机应用研究, 2023, 40 (1): 172-177,184. (Pan Jikui, Dong Xinyi, Wang Zijian, et al. Cost optimization algorithm based on dynamic allocation of deadline for workflow scheduling in clouds [J]. Application Research of Computers, 2023, 40 (1): 172-177,184. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.

Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)