应用并行计算解决指纹重卡计算瓶颈  

The Parallel Computing Methods for Solving the Problem of Repeat Fingerprint Card Merging

作　　者：吴春生[1,2] 迟学斌[2] 冯才刚 王彦棡[2] 

机构地区：[1]北京市刑事科学技术研究所,北京100054 [2]中国科学院计算机网络信息中心,北京100190

出　　处：《科研信息化技术与应用》2011年第6期92-98,共7页E-science Technology & Application

摘　　要：本文介绍了使用并行技术解决北京公安机关指纹库重卡归并计算难题及应用情况。首先介绍了重卡归并的意义和重卡计算面临的问题;然后分析重卡归并采用并行计算的可行性和改造方式,其中重点分析了不同改造方式的优劣并对相关技术问题进行了介绍;最后对并行程序加速比和运行结果进行了说明。This paper introduces the application that using parallel computing technology to solve the problem of Beijing Public Security Bureau fingerprint database repeat fingerprint card merge. Firstly, the significance of repeat fingerprint card merge calculation and the problems of repeat fingerprint card computing are introduced, then the feasibility and transformation method of the computing, especially the advantages and disadvantages of different transformation methods are analyzed, and several technical problems in parallel program are introduced. Finally the parallel accelerate efficiency and operating results of parallel program are stated.

关 键 词：指纹比对 重卡归并 并行计算 高性能计算 

分 类 号：D918.91[政治法律—法学]