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

Sucharitha Shetty, B. Dinesh Rao, Srikanth Prabhu

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
CountryChina
CityNanning
Period09-11-1811-11-18

Fingerprint

Data Partitioning
String Matching
Message Passing Interface
Message passing
Caching
Parallel algorithms
Parallel Algorithms
Optimization Techniques
Parallelism
Decrease
Experiment
Experiments
Concepts
Architecture

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

Cite this

Shetty, S., Rao, B. D., & Prabhu, S. (2018). An optimized parallel algorithm for exact string matching using message passing interface. In Q. Chen, J. Wu, S. Zhang, C. Yuan, L. Batten, & G. Li (Eds.), Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings (pp. 129-135). (Communications in Computer and Information Science; Vol. 950). Springer Verlag. https://doi.org/10.1007/978-981-13-2907-4_11
Shetty, Sucharitha ; Rao, B. Dinesh ; Prabhu, Srikanth. / An optimized parallel algorithm for exact string matching using message passing interface. Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings. editor / Qingfeng Chen ; Jia Wu ; Shichao Zhang ; Changan Yuan ; Lynn Batten ; Gang Li. Springer Verlag, 2018. pp. 129-135 (Communications in Computer and Information Science).
@inproceedings{270cb6d44cb04e46883eece55dc6ff10,
title = "An optimized parallel algorithm for exact string matching using message passing interface",
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.",
author = "Sucharitha Shetty and Rao, {B. Dinesh} and Srikanth Prabhu",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-981-13-2907-4_11",
language = "English",
isbn = "9789811329067",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "129--135",
editor = "Qingfeng Chen and Jia Wu and Shichao Zhang and Changan Yuan and Lynn Batten and Gang Li",
booktitle = "Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings",
address = "Germany",

}

Shetty, S, Rao, BD & Prabhu, S 2018, An optimized parallel algorithm for exact string matching using message passing interface. in Q Chen, J Wu, S Zhang, C Yuan, L Batten & G Li (eds), Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings. Communications in Computer and Information Science, vol. 950, Springer Verlag, pp. 129-135, 9th International Conference on Applications and Techniques in Information Security, ATIS 2018, Nanning, China, 09-11-18. https://doi.org/10.1007/978-981-13-2907-4_11

An optimized parallel algorithm for exact string matching using message passing interface. / Shetty, Sucharitha; Rao, B. Dinesh; Prabhu, Srikanth.

Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings. ed. / Qingfeng Chen; Jia Wu; Shichao Zhang; Changan Yuan; Lynn Batten; Gang Li. Springer Verlag, 2018. p. 129-135 (Communications in Computer and Information Science; Vol. 950).

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

TY - GEN

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

AU - Shetty, Sucharitha

AU - Rao, B. Dinesh

AU - Prabhu, Srikanth

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85072865833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072865833&partnerID=8YFLogxK

U2 - 10.1007/978-981-13-2907-4_11

DO - 10.1007/978-981-13-2907-4_11

M3 - Conference contribution

SN - 9789811329067

T3 - Communications in Computer and Information Science

SP - 129

EP - 135

BT - Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings

A2 - Chen, Qingfeng

A2 - Wu, Jia

A2 - Zhang, Shichao

A2 - Yuan, Changan

A2 - Batten, Lynn

A2 - Li, Gang

PB - Springer Verlag

ER -

Shetty S, Rao BD, Prabhu S. An optimized parallel algorithm for exact string matching using message passing interface. In Chen Q, Wu J, Zhang S, Yuan C, Batten L, Li G, editors, Applications and Techniques in Information Security - 9th International Conference, ATIS 2018, Proceedings. Springer Verlag. 2018. p. 129-135. (Communications in Computer and Information Science). https://doi.org/10.1007/978-981-13-2907-4_11