Skip to main content
SpringerLink
Log in

An Optimized Parallel Algorithm for Exact String Matching Using Message Passing Interface

  • Conference paper
  • First Online:
Applications and Techniques in Information Security (ATIS 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 950))

  • 386 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. DeWitt, D., Gray, J.: Parallel database systems: the future of high performance database systems. Commun. ACM 35(6), 85–98 (1992)

    Article  Google Scholar 

  2. Chaarawi, M., Dinan, J., Kimpe, D.: On the usability of the MPI shared file pointer routines. In: Träff, J.L., Benkner, S., Dongarra, J.J. (eds.) EuroMPI 2012. LNCS, vol. 7490, pp. 258–267. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33518-1_31

    Chapter  Google Scholar 

  3. Message Passing Interface Forum: MPI-2: Extensions to the Message Passing Interface (1997). http://www.mpi-forum.org/

  4. Chaarawi, M., Gabriel, E., Keller, R., Graham, R.L., Bosilca, G., Dongarra, J.J.: OMPIO: a modular software architecture for MPI I/O. In: Cotronis, Y., Danalis, A., Nikolopoulos, D.S., Dongarra, J. (eds.) EuroMPI 2011. LNCS, vol. 6960, pp. 81–89. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24449-0_11

    Chapter  Google Scholar 

  5. Navarro, G.: Pattern matching. J. Appl. Stat. 31(8), 925–949 (2004)

    Article  MathSciNet  Google Scholar 

  6. Rajashekharaiah, K.M.M., MadhuBabu, C., Raju, S.V.: Parallel string matching algorithm using grid. Int. J. Distrib. Parallel Syst. 3(3), 21 (2012)

    Article  Google Scholar 

  7. Sharma, R., Kumar, R.: Design and analysis of parallel linear search algorithm. Int. J. Latest Trends Eng. Technol. 10(1), 35–38 (2018)

    Google Scholar 

  8. Byna, S., Chen, Y., Sun, X.H., Thakur, R., Gropp, W.: Parallel I/O prefetching using MPI file caching and I/O signatures. In: Proceedings of the 2008 ACM/IEEE Conference on Supercomputing, p. 44. IEEE Press (2008)

    Google Scholar 

  9. Michailidis, P.D., Margaritis, K.G.: String matching problem on a cluster of personal computers: experimental results. In: Proceedings of the 15th International Conference Systems for Automation of Engineering and Research, pp. 71–75 (2001)

    Google Scholar 

  10. Flynn, M.J.: Very high-speed computing systems. Proc. IEEE 54(12), 1901–1909 (1966)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, 576104, Karnataka, India

    Sucharitha Shetty & Srikanth Prabhu

  2. School of Information Science, Manipal Academy of Higher Education, Manipal, 576104, Karnataka, India

    B. Dinesh Rao

Authors
  1. Sucharitha Shetty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Dinesh Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Srikanth Prabhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. Dinesh Rao .

Editor information

Editors and Affiliations

  1. Guangxi University, Nanning, China

    Qingfeng Chen

  2. Macquarie University, Sydney, NSW, Australia

    Jia Wu

  3. Guangxi Normal University, Nanning, China

    Shichao Zhang

  4. Guangxi College of Education, Nanning, China

    Changan Yuan

  5. Deakin University, Geelong, VIC, Australia

    Lynn Batten

  6. Deakin University, Geelong, VIC, Australia

    Gang Li

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shetty, S., Rao, B.D., Prabhu, S. (2018). 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. (eds) Applications and Techniques in Information Security. ATIS 2018. Communications in Computer and Information Science, vol 950. Springer, Singapore. https://doi.org/10.1007/978-981-13-2907-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2907-4_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2906-7

  • Online ISBN: 978-981-13-2907-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation