Parallelization of KMP String Matching Algorithm

被引：0

作者：

Alzoabi, Ubaid S. ^{[1
]}

Alosaimi, Naser M. ^{[1
]}

Bedaiwi, Abdullah S. ^{[1
]}

Alabdullatif, Abdullatif M. ^{[1
]}

机构：

[1] King Saud Univ, Coll Comp & Informat Sci, Dept Comp Sci, Riyadh, Saudi Arabia

来源：

WORLD CONGRESS ON COMPUTER & INFORMATION TECHNOLOGY (WCCIT 2013) | 2013年

关键词：

component; KMP algorithm; String matching; parallelism; parallel algorithm;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Knuth Morris-Pratt (KMP) algorithm is one of the most popular strings searching algorithm. The parallelism of KMP is one of research topic over last two years. In our paper we simulated two current parallel algorithms with our new proposed parallel algorithm. Our simulation result presents improvement of our proposed parallel algorithm.

引用

页数：3