Journal of University of Science and Technology of China ›› 2018, Vol. 48 ›› Issue (9): 718-722.DOI: 10.3969/j.issn.0253-2778.2018.09.005

• Original Paper • Previous Articles     Next Articles

Dynamic task scheduling algorithm of parallel computing for FCD big data

CHEN Feng, ZHANG Zhi, LI Qinjian, CHEN Yuqiang, CHEN Guoliang   

  1. 1. Department of Automation, University of Science and Technology of China, Hefei 230027, China; 2. Anhui LoongSon Science and Technology Co.,Ltd, Hefei 230088, China; 3. School of Computer Science and technology, University of Science and Technology of China, Hefei 230027, China
  • Received:2018-03-27 Revised:2018-04-27 Accepted:2018-04-27 Online:2018-09-30 Published:2018-04-27

Abstract: FCD (floating car data) technique is new way of collecting real-time traffic flow from large-scale urban networks. It is necessary to implement rapid processing of FCD big data for the dynamic guidance and control of urban traffic. A dynamic task scheduling algorithm is proposed for parallel computation of FCD. To address the uncertainty and dynamics of FCD package processing, FCD packages are partitioned dynamically. The load balance among computing nodes can be achieved using the dynamic task allocation strategy. The algorithm is developed on LoongSon big data integrated machine platform and evaluated using field FCD. The experimental results indicate that the proposed algorithm has significantly higher parallel processing performances compared to the polling scheduling algorithm and Min-Min scheduling algorithm.

Key words: floating car data, big data, parallel computing, dynamic task partition, dynamic task scheduling

CLC Number: