@inproceedings{b45ba357f5f2432f9cc0f9726ccaf359,
title = "An Efficient Parallel String Matching Algorithm Based on DFA",
abstract = "The classical string matching algorithms are facing a great challenge on speed due to the rapid growth of information on Internet. Meanwhile, multi-core CPU has been widespread on computers. But classical string matching algorithms does not apply to multi-core CPU flexibly. It not only affects the run-time speed, but also makes a waste of the resource on CPU. In this paper, we proposed a parallel string matching algorithm based on DFA, it solved the problem effectively. By classification on the first letter of each pattern, all CPU cores could work at the same time, which do not conflict. Experiments demonstrate whether the hit rate is high or low, the algorithm has an ideal performance.",
keywords = "DFA, Parallel algorithm, String matching",
author = "Yujian Fan and Hongli Zhang and Jiahui Liu and Dongliang Xu",
year = "2013",
doi = "10.1007/978-3-642-35795-4\_44",
language = "英语",
isbn = "9783642357947",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "349--356",
booktitle = "Trustworthy Computing and Services - International Conference, ISCTCS 2012, Revised Selected Papers",
address = "德国",
note = "International Conference on Trustworthy Computing and Services, ISCTCS 2012 ; Conference date: 28-05-2012 Through 02-06-2012",
}