The Approximate String Matching on the Hierarchical Memory Machine, with Performance Evaluation

@article{Man2013TheAS,
  title={The Approximate String Matching on the Hierarchical Memory Machine, with Performance Evaluation},
  author={Duhu Man and Koji Nakano and Yasuaki Ito},
  journal={2013 IEEE 7th International Symposium on Embedded Multicore Socs},
  year={2013},
  pages={79-84}
}
The Hierarchical Memory Machine (HMM) is a theoretical parallel computing model that captures the essence of computing on CUDA-enabled GPUs. The approximate string matching (ASM) for two strings X and Y of length m and n is a task to find a sub string of Y most similar to X. The main contribution of this paper is to show an optimal parallel algorithm for the approximate string matching on the HMM and to implement it on a CUDA-enabled GPU. Our algorithm runs in O(n/w+mn/dw + nL/p + mnl/p) on the… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS