A Memory-Access-Efficient Implementation for Computing the Approximate String Matching Algorithm on GPUs

作者：Nunes Lucas Saad Nogueira; Bordim Jacir Luiz^*; Ito Yasuaki; Nakano Koji

来源：IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016, E99D(12): 2995-3003.

DOI：10.1587/transinf.2016PAP0024

• approximate string matching
• edit distance
• GPU
• CUDA
• shuffle instructions

The closeness of a match is an important measure with a number of practical applications, including computational biology, signal processing and text retrieval. The approximate string matching (ASM) problem asks to find a substring of string Y of length n that is most similar to string X of length m. It is well-know that the ASM can be solved by dynamic programming technique by computing a table of size m x n. The main contribution of this work is to present a memory-access-efficient implementation for computing the ASM on a GPU. The proposed GPU implementation relies on warp shuffle instructions which are used to accelerate the communication between threads without resorting to shared memory access. Despite the fact that O(mn) memory access operations are necessary to access all elements of a table with size n x m, the proposed implementation performs only O(mn w) memory access operations, where w is the warp size. Experimental results carried out on a GeForce GTX 980 GPU show that the proposed implementation, called w-SCAN, provides speed-up of over two fold in computing the ASM as compared to another prominent alternative.

• 出版日期2016-12