An intelligent scheduling algorithm for complex manufacturing system simulation with frequent synchronizations in a cloud environment
- 114 Downloads
- 1 Citations
Abstract
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.
Keywords
Frequent synchronizations Intelligent manufacturing Manufacturing system Performance estimation Parallel and distributed simulation Resource allocationNotes
Acknowledgements
This work was financially supported by the National Natural Science Foundation of China (61702527, 61802422, 61773120).
Author Contributions
FY and TL wrote the paper; YY, LX, ZL and HC revised this paper.
Compliance with ethical standards
Conflict of interest
The authors declare no conflict of interest.
References
- 1.Xu X (2012) From cloud computing to cloud manufacturing. Robot Comput Integr Manuf 28(1):75–86CrossRefGoogle Scholar
- 2.Schaefer D (2014) Cloud-based design and manufacturing. Springer, BerlinCrossRefGoogle Scholar
- 3.Negahban A, Smith S (2014) Simulation for manufacturing system design and operation: literature review and analysis. J Manuf Syst 33(2):241–261CrossRefGoogle Scholar
- 4.Mourtzis D, Doukas M, Bernidaki D (2014) Simulation in manufacturing: review and challenges. In: International conference on digital enterprise technology—Det, Rio Patras, GreeceCrossRefGoogle Scholar
- 5.Heilala J, Vatanen S, Tonteri H, Montonen J, Lind S, Johansson B, Stahre J (2008) Simulation based sustainable manufactuing system design. In: Proceedings of the winter simulation conferenceGoogle Scholar
- 6.Han Y, Gong D, Jin Y, Pan Q (2019) Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE Trans Cybern 49(1):184–197CrossRefGoogle Scholar
- 7.Chen H, Zhu X, Liu G, Pedrycz W (2018) Uncertainty-aware online scheduling for real-time workflows in cloud service environment. IEEE Trans Serv Comput (to be published)Google Scholar
- 8.Gong D, Han Y, Sun J (2018) A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems. Knowl Based Syst 148:115–130CrossRefGoogle Scholar
- 9.Mezmaz M, Melab N, Kessaci Y, Lee YC, Talbi EG, Zomaya AY, Tuyttens D (2011) A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. J Parallel Distrib Comput 71(11):1497–1508CrossRefGoogle Scholar
- 10.Jena T, Mohanty JR (2018) Ga-based customer-conscious resource allocation and task scheduling in multi-cloud computing. Arab J Sci Eng 43(8):4115–4130CrossRefGoogle Scholar
- 11.Dam S, Mandal G, Dasgupta K, Dutta P (2016) Genetic algorithm and gravitational emulation based hybrid load balancing strategy in cloud computing. In: Third international conference on computer, communication, control and information technology (C3IT)Google Scholar
- 12.Wei G, Vasilakos AV, Zheng Y, Xiong N (2010) A game-theoretic method of fair resource allocation forcloud computing services. J Supercomput 54(2):252–269CrossRefGoogle Scholar
- 13.Chen XJ, Jing Z, Jun-Huai LI (2011) Key technology for multi-virtual machine collaborative computing oriented to path search tasks. Comput Integr Manuf Syst 17(10):2298–2308Google Scholar
- 14.Beaumont O, Carter L, Ferrante J, Legrand A, Marchal L, Robert Y (2008) Centralized versus distributed schedulers for bag-of-tasks applications. IEEE Trans Parallel Distrib Syst 19(5):698–709CrossRefGoogle Scholar
- 15.Fujimoto RM, Malik AW, Park AJ (2010) Parallel and distributed simulation in the cloud. SCS M&S Mag 3:1–10Google Scholar
- 16.Netto S, Netto S, Buyya R (2009) Adaptive co-allocation of distributed resources for parallel applications. PhD thesis, University of Melbourne, Department of Computer Science and software EngineeringGoogle Scholar
- 17.Chen H, Zhu X, Qiu D, Liu L, Du Z (2017) Scheduling for workflows with security-sensitive intermediate data by selective tasks duplication in clouds. IEEE Trans Parallel Distrib Syst 28(9):2674–2688CrossRefGoogle Scholar
- 18.Yang C, Chai X, Zhang F (2012) Research on co-simulation task scheduling based on virtualization technology under cloud simulation. Springer, BerlinCrossRefGoogle Scholar
- 19.Culler D, Karp R, Patterson D, Sahay A, Schauser KE, Santos E, Subramonian R, Von Eicken T (1993) Logp: towards a realistic model of parallel computation. ACM Sigplan Not 28(7):1–12CrossRefGoogle Scholar
- 20.Park EJ, Eidenbenz S, Santhi N, Chapuis G, Settlemyer B (2015) Parameterized benchmarking of parallel discrete event simulation systems: communication, computation, and memory. In: Winter simulation conferenceGoogle Scholar
- 21.Li WD, Ong SK, Nee AYC (2002) Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts. Int J Prod Res 40(8):1899–1922CrossRefGoogle Scholar
- 22.Han Y-Y, Gong D, Sun X (2015) A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking. Eng Optim 47(7):927–946MathSciNetCrossRefGoogle Scholar
- 23.Liang Y, Leung K-S (2011) Genetic algorithm with adaptive elitist-population strategies for multimodal function optimization. Appl Soft Comput 11(1):2017–2034CrossRefGoogle Scholar
- 24.Zafeirios P, Helen K (2015) Scheduling bags of tasks and gangs in a distributed system. In: 2015 international conference on computer, information and telecommunication systems (CITS)Google Scholar
- 25.Santhosh B, Manjaiah DH (2016) A hybrid avgtask-min and max-min algorithm for scheduling tasks in cloud computing. In: International Conference on Control, Instrumentation, Communication and Computational TechnologiesGoogle Scholar
- 26.Buquan LIU, Yiping YAO, Wang H (2012) On the technology of high-performance parallel simulation. Chin J Electron 21(1):1–6Google Scholar
- 27.ThinkWiki (2018) How to use cpufrequtils. http://www.thinkwiki.ort/wiki/How_to_use_cpufrequtils. Accessed 8 Aug 2018
- 28.Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern 24(4):656–667CrossRefGoogle Scholar