Yinghang Jiang¹, Qi Liu^2,3,*, Williams Dannah¹, Dandan Jin², Xiaodong Liu³, Mingxu Sun^4,*

CMC-Computers, Materials & Continua, Vol.62, No.2, pp. 713-729, 2020, DOI:10.32604/cmc.2020.04604

Abstract Hadoop is a well-known parallel computing system for distributed computing and large-scale data processes. “Straggling” tasks, however, have a serious impact on task allocation and scheduling in a Hadoop system. Speculative Execution (SE) is an efficient method of processing “Straggling” Tasks by monitoring real-time running status of tasks and then selectively backing up “Stragglers” in another node to increase the chance to complete the entire mission early. Present speculative execution strategies meet challenges on misjudgement of “Straggling” tasks and improper selection of backup nodes, which leads to inefficient implementation of speculative executive processes. This paper has proposed an Optimized Resource… More >

Jin Wang^{1, 2, 3}, Yu Gao², Chang Zhou², R. Simon Sherratt⁴, Lei Wang^{5, *}

CMC-Computers, Materials & Continua, Vol.62, No.2, pp. 695-711, 2020, DOI:10.32604/cmc.2020.08674

Abstract Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy… More >

Yuankun Yan^1,*, Yan Kong¹, Zhangjie Fu^1,2

Journal of Information Hiding and Privacy Protection, Vol.1, No.3, pp. 143-155, 2019, DOI:10.32604/jihpp.2019.07772

Abstract Nowadays, emergency accidents could happen at any time. The accidents occur unpredictably and the accidents requirements are diversely. The accidents happen in a dynamic environment and the resource should be cooperative to solve the accidents. Most methods are focusing on minimizing the casualties and property losses in a static environment. However, they are lack in considering the dynamic and unpredictable event handling. In this paper, we propose a representative environmental model in representation of emergency and dynamic resource allocation model, and an adaptive mathematical model based on Genetic Algorithm (GA) to generate an optimal set of solution domain. The experimental… More >

Wenbin Yu^{1, 2, 3, *}, Yinsong Xu^{1, 2, 3}, Wenjie Liu^{1, 2, 3}, Alex Xiangyang Liu⁴, Baoyu Zheng⁵

Journal of Quantum Computing, Vol.1, No.2, pp. 111-118, 2019, DOI:10.32604/jqc.2019.07412

Abstract Suppose a practical scene that when two or more parties want to schedule an appointment, they need to share their calendars with each other in order to make it possible. According to the present result the whole communication cost to solve this problem should be their calendars’ length by using a classical algorithm. In this work, we investigate the appointment schedule issue made by N users and try to accomplish it in quantum information case. Our study shows that the total communication cost will be quadratic times smaller than the conventional case if we apply a quantum algorithm in the… More >

Tianbo Lu^1,2,*, Ru Yan^1,2, Chao Li^3,*, Lihua Yin³, Hao Chen¹, Xieyu Zou⁴

CMC-Computers, Materials & Continua, Vol.59, No.3, pp. 965-982, 2019, DOI:10.32604/cmc.2019.05635

Abstract With the rapid development of the Internet, people pay more and more attention to the protection of privacy. The second-generation onion routing system Tor is the most commonly used among anonymous communication systems, which can be used to protect user privacy effectively. In recent years, Tor’s congestion problem has become the focus of attention, and it can affect Tor’s performance even user experience. Firstly, we investigate the causes of Tor network congestion and summarize some link scheduling algorithms proposed in recent years. Then we propose the link scheduling algorithm SWRR based on WRR (Weighted Round Robin). In this process, we… More >

Lanlan Rui¹, Yabin Qin^1,*, Biyao Li¹, Zhipeng Gao¹

CMES-Computer Modeling in Engineering & Sciences, Vol.118, No.2, pp. 291-315, 2019, DOI:10.31614/cmes.2018.04240

Abstract Maintenance is an important aspect in the lifecycle of communication network devices. Prevalent problems in the maintenance of communication networks include inconvenient data carrying and sub-optimal scheduling of work orders, which significantly restrict the efficiency of maintenance work. Moreover, most maintenance systems are still based on cloud architectures that slow down data transfer. With a focus on the completion time, quality, and load balancing of maintenance work, we propose in this paper a learning-based virus evolutionary genetic algorithm with multiple quality-of-service (QoS) constraints to implement intelligent scheduling in an edge network. The algorithm maintains the diversity of the population and… More >

P. Redou¹, L. Gaubert¹, G. Desmeulles¹, P-A. Béal², C. Le Gal², V. Rodin³

CMES-Computer Modeling in Engineering & Sciences, Vol.70, No.1, pp. 11-40, 2010, DOI:10.3970/cmes.2010.070.011

Abstract Multi Interaction Systems, used in the context of Virtual Reality, are dedicated to real-time interactive simulations. They open the way to the in virtuo experimentation, especially useful in the domain of biochemical kinetics. To this purpose, chaotic and asynchronous scheduling of autonomous processes is based upon desynchronization of phenomena involved in the system. It permits interactivity, especially the capability to add or remove phenomena in the course of a simulation. It provides methods of resolution of ordinary differential systems and partial derivative equations. Proofs of convergence for these methods have been established, but the problem of absolute stability, although it… More >

Yonghua Zhou¹, Chao Mi¹

CMES-Computer Modeling in Engineering & Sciences, Vol.83, No.1, pp. 1-22, 2012, DOI:10.3970/cmes.2012.083.001

Abstract Cellular automata (CAs), model the dynamics of complex systems as the state update of cells restricted from their own neighbors. This paper regards the tempo-spatial constraints as dummy neighborhoods of cells for train movement, such as scheduled movement authority and speed restriction, equivalent to the maximum displacements during the future certain time steps and each time step, respectively. Under the framework of CA modeling, this paper attempts to propose an improved CA model for moving-block railway network which incorporates the tempo-spatial constraints to capture the restrictive, synergistic and autonomous dynamics. We divide the one-dimensional cell lattice into several segments, called… More >

Xuewen Zhang¹, Zhonghao Li¹, Gongshen Liu^1,*, Jiajun Xu¹, Tiankai Xie², Jan Pan Nees¹

CMC-Computers, Materials & Continua, Vol.55, No.3, pp. 405-417, 2018, DOI: 10.3970/cmc.2018.02527

Abstract As a main distributed computing system, Spark has been used to solve problems with more and more complex tasks. However, the native scheduling strategy of Spark assumes it works on a homogenized cluster, which is not so effective when it comes to heterogeneous cluster. The aim of this study is looking for a more effective strategy to schedule tasks and adding it to the source code of Spark. After investigating Spark scheduling principles and mechanisms, we developed a stratifying algorithm and a node scheduling algorithm is proposed in this paper to optimize the native scheduling strategy of Spark. In this… More >