Journal of Computer Applications ›› 2021, Vol. 41 ›› Issue (9): 2586-2593.DOI: 10.11772/j.issn.1001-9081.2020111173

Special Issue: 数据科学与技术

• Data science and technology • Previous Articles     Next Articles

Parallel decompression algorithm for high-speed train monitoring data

WANG Zhoukai, ZHANG Jiong, MA Weigang, WANG Huaijun   

  1. Faculty of Computer Science and Engineering, Xi'an University of Technology, Xi'an Shaanxi 710048, China
  • Received:2020-08-04 Revised:2021-01-12 Online:2021-09-10 Published:2021-05-08
  • Supported by:
    This work is partially supported by the National Key Research and Development Program of China (2018YFB1703000), the NSFC-High Speed Rail Joint Fund Key Project (U173410), the Special Project of Scientific Research Plan of Shaanxi Provincial Department of Education (21JK0781).


王周恺, 张炯, 马维纲, 王怀军   

  1. 西安理工大学 计算机科学与工程学院, 西安 710048
  • 通讯作者: 王周恺
  • 作者简介:王周恺(1989-),男,陕西安康人,讲师,博士,主要研究方向:并行计算;张炯(1994-),男,山西大同人,硕士研究生,主要研究方向:高性能计算;马维纲(1976-),男,甘肃兰州人,副教授,博士,主要研究方向:编译优化;王怀军(1981-),男,山东滕州人,副教授,博士,主要研究方向:边缘计算。
  • 基金资助:

Abstract: The real-time monitoring data generated by high-speed trains during running are usually processed by variable-length coding compression technology, which is convenient for transmission and storage. However, this method will complicate the internal structure of the compressed data, so that the corresponding data decompression process must follow the composition order of the compressed data, which is inefficient. In order to improve the decompression efficiency of high-speed train monitoring data, a parallel decompression algorithm for high-speed train monitoring data was proposed with the help of the speculation technology. Firstly, the structural characteristics of high-speed train monitoring data were studied, and the internal dependence that affects data division was analyzed. Secondly, the speculation technology was used to clean up internal dependence, and then, the data were divided into different parts tentatively. Thirdly, the division results were decompressed in a distributed computing environment in parallel. Finally, the parallel decompression results were combined together. Through this way, the decompression efficiency of high-speed train monitoring data was improved. Experimental results showed that on the computing cluster composed of 7 computing nodes, compared with the serial algorithm, the speedup of the proposed speculative parallel algorithm was about 3, showing a good performance of this algorithm. It can be seen that this algorithm can improve the monitoring data decompression efficiency significantly.

Key words: high-speed train, variable-length coding, decompression, speculative parallelism, distributed computing, parallelization

摘要: 高速列车在运行时产生的实时监测数据通常用变长编码压缩技术进行处理,以便于传输和存储。然而这种方法会使得压缩数据内部结构复杂,导致相应的数据解压缩过程只能遵照压缩数据的组成顺序进行,效率较低。为提升高速列车监测数据的解压缩效率,借助推测技术,提出一种面向高速列车监测数据的并行解压缩算法。首先,研究高速列车监测数据的结构特征,分析影响数据划分的内部依赖;其次,利用推测技术消解内部依赖后,对数据进行试探性划分;然后在分布式计算环境中对划分结果并行地进行解压;最后将并行解压缩结果合并起来,从而提高针对高速列车监测数据的解压缩效率。实验结果表明,在由7个计算节点组成的计算集群上,与串行算法相比,所提推测并行算法的加速比为3左右,展现了该算法良好的性能,可见该算法能够显著提高针对列车监测数据的解压缩效率。

关键词: 高速列车, 变长编码, 解压缩, 推测并行, 分布式计算, 并行化

CLC Number: