eMDPM: Efficient Multidimensional Pattern Matching Algorithm for GPU

Author(s):  
Supragya Raj ◽  
Siddha Prabhu Chodnekar ◽  
T. Harish ◽  
Harini Sriraman
Author(s):  
KUO-LIANG CHUNG

Given a pattern of length m and a text of length n, commonly m≪n, this paper presents a randomized parallel algorithm for pattern matching in O(n1/10) (=O(n1/10+(n−m)1/10)) time on a newly proposed n3/5×n2/5 modular meshconnected computers with multiple buses. Furthermore, the time bound of our parallel algorithm can be reduced to O(n1/11) if fewer processors are used.


2017 ◽  
Vol 80 ◽  
pp. 162-170 ◽  
Author(s):  
Muhammad Tahir ◽  
Muhammad Sardaraz ◽  
Ataul Aziz Ikram

Sign in / Sign up

Export Citation Format

Share Document