An intelligent scheduling algorithm for complex manufacturing system simulation with frequent synchronizations in a cloud environment

被引:13
作者
Yao, Feng [1 ]
Yao, Yiping [1 ]
Xing, Lining [1 ,2 ]
Chen, Huangke [1 ]
Lin, Zhongwei [3 ]
Li, Tianlin [1 ]
机构
[1] Natl Univ Def Technol, Coll Syst Engn, Changsha, Peoples R China
[2] Shanghai Polytech Univ, Coll Engn, Shanghai, Peoples R China
[3] Natl Univ Def Technol, Coll Elect Warfare, Hefei, Peoples R China
基金
中国国家自然科学基金;
关键词
Frequent synchronizations; Intelligent manufacturing; Manufacturing system; Performance estimation; Parallel and distributed simulation; Resource allocation; GENETIC ALGORITHM;
D O I
10.1007/s12293-019-00284-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
For cloud-based, large-scale complex manufacturing system simulation (CMSS), allocating appropriate service instances (virtual machines or nodes) is a promising way to improve execution efficiency. However, the complex interactions among and frequent aperiodic synchronizations of the entities of a CMSS make it challenging to estimate the influence of service instances' computing power and network latency on the execution efficiency. This hinders the appropriate allocation of service instances for CMSS. To solve this problem, we construct a performance estimation model (PEM) using the executed events and synchronization algorithms to evaluate the running time of CMSS on different service instance combinations. Further, an intelligent scheduling algorithm that introduces PEM as fitness function is proposed to search for a near-optimal allocation scheme of CMSS service instances. To be specific, the PEM-based optimization algorithm (PEMOA) incorporates simulated annealing into the mutation phase of a genetic algorithm to strengthen its local searching ability. A series of experiments were performed on a computer cluster to compare the proposed PEMOA with two representative algorithms: an adapted first-come-first-service-based and the max-min-based allocation algorithms. The experimental results demonstrate that the PEMOA can reduce the running time by more than 7%. In particular, the improvement of PEMOA increases when the manufacturing system simulation is communication-intensive or spans a small number of service instance combinations.
引用
收藏
页码:357 / 370
页数:14
相关论文
共 27 条
  • [1] Alt A, 2018, IEEE WIREL POWER TRA
  • [2] Centralized versus distributed schedulers for bag-of-tasks applications
    Beaumont, Olivier
    Carter, Larry
    Ferrante, Jeanne
    Legrand, Arnaud
    Marchal, Loris
    Robert, Yves
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (05) : 698 - 709
  • [3] Scheduling for Workflows with Security-Sensitive Intermediate Data by Selective Tasks Duplication in Clouds
    Chen, Huangke
    Zhu, Xiaomin
    Qiu, Dishan
    Liu, Ling
    Du, Zhihui
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (09) : 2674 - 2688
  • [4] Chen Xiao-Jun, 2011, Computer Integrated Manufacturing Systems, V17, P2298
  • [5] CULLER D, 1993, SIGPLAN NOTICES, V28, P1, DOI 10.1145/173284.155333
  • [6] Dam S, 2016, 3 INT C COMP COMM CO
  • [7] Fujimoto RichardM., 2010, SCS Modeling and Simulation Magazine, Society for Modeling and Simulation, Intl, P1
  • [8] A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems
    Gong, Dunwei
    Han, Yuyan
    Sun, Jianyong
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 148 : 115 - 130
  • [9] A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking
    Han, Yu-Yan
    Gong, Dunwei
    Sun, Xiaoyan
    [J]. ENGINEERING OPTIMIZATION, 2015, 47 (07) : 927 - 946
  • [10] Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns
    Han, Yuyan
    Gong, Dunwei
    Jin, Yaochu
    Pan, Quanke
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (01) : 184 - 197