An optimized parallel algorithm for exact string matching using message passing interface

Sucharitha Shetty, B. Dinesh Rao*, Srikanth Prabhu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Data Partitioning is one of the key approaches followed in parallelism. It has proved its efficiency on many algorithms and still lot of work is going on this area. In this paper we propose an optimization technique for string matching using data partitioning with multi-core architecture. The paper primarily focuses on caching and re-utilization of processes. The experiments showed that concept of caching increased the speed drastically for frequently asked patterns. The MPI proposed implementation highlighted the increase in efficiency using multi-core and decrease in performance when the cores were reutilized.

Original languageEnglish
Title of host publicationApplications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings
EditorsQingfeng Chen, Jia Wu, Shichao Zhang, Changan Yuan, Lynn Batten, Gang Li
PublisherSpringer Verlag
Pages129-135
Number of pages7
ISBN (Print)9789811329067
DOIs
Publication statusPublished - 01-01-2018
Event9th International Conference on Applications and Techniques in Information Security, ATIS 2018 - Nanning, China
Duration: 09-11-201811-11-2018

Publication series

NameCommunications in Computer and Information Science
Volume950
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Conference

Conference9th International Conference on Applications and Techniques in Information Security, ATIS 2018
Country/TerritoryChina
CityNanning
Period09-11-1811-11-18

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'An optimized parallel algorithm for exact string matching using message passing interface'. Together they form a unique fingerprint.

Cite this