Loading menu…

A Parallel Computational Approach for String Matching- A Novel Structure with Omega Model

§ GRIET AFF TO JNTUH

Send Message

To: Author

A Parallel Computational Approach for String Matching- A Novel Structure with Omega Model

Article Fingerprint

ReserarchID

CST529J0

A Parallel Computational Approach for String Matching- A Novel Structure with Omega Model Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

In recent day’s parallel string matching problem catch the attention of so many researchers because of the importance in different applications like IRS, Genome sequence, data cleaning etc.,. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a omega parallel computing model for parallel string matching. The algorithm is designed to work on omega model parallel architecture where text is divided for parallel processing and special searching at division point is required for consistent and complete searching. This algorithm reduces the number of comparisons and parallelization improves the time efficiency. Experimental results show that, on a multi-processor system, the omega model implementation of the proposed parallel string matching algorithm can reduce string matching time.

References

56 Cites in Article
  1. 1. Chinta Someswararao,S Butchiraju,Viswanadharaju (2011). Recent Advancement is Parallel Algorithms for String matching on computing models -A survey and experimental results. LNCS, 270-278.
  2. 2. Chinta Someswararao,S Butchiraju,Viswanadharaju (2011). PDM data classification from STEP-an object oriented String matching approach. IEEE conference on Application of Information and Communication Technologies, 1-9.
  3. 3. Chinta Someswararao,K Raju,S Appaji,S Raju,K Reddy (2012). Recent Advancements in Parallel Algorithms for String Matching on Computing Models – A Survey and Experimental Results. Lecture Notes in Computer Science, 4, 270-278.
  4. 4. Y Simon,M Inayatullah (2004). Improving Approximate Matching Capabilities for Meta Map Transfer Applications. Proceedings of Symposium on Principles and Practice of Programming in Java, 143-147.
  5. 5. Chinta Someswararao,S Butchiraju,Viswanadharaju (2012). Parallel Algorithms for String Matching Problem based on Butterfly Model. IJCST, 3(3), 41-56.
  6. 6. Chinta Someswararao,S Butchiraju,Viswanadharaju (2013). Recent Advancement is String matching algorithms-A survey and experimental results. IJCIS, 6(3), 56-61.
  7. 7. S Raju (2012). parallel string matching algorithm using grid. international journal of distributed and parallel systems, 3(3)
  8. 8. Leslie Valiant (1990). A bridging model for parallel computation. Commun. ACM, 33(8), 103-111.
  9. 9. I Foster (1996). Designing and Building Paral lel Programs. Designing and Building Paral lel Programs
  10. 10. (1991). Argonne National Laboratory annual report of laboratory directed research and development program activities for FY 1995. Argonne National Laboratory annual report of laboratory directed research and development program activities for FY 1995.
  11. 11. J Darlington,M Ghanem,H To (1993). Structured parallel programming. Proceedings of Workshop on Programming Models for Massively Parallel Computers, 160-169.
  12. 12. N Tuck,T Sherwood,B Calder,G Varghese (2004). Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection. Proceedings of IEEE Infocom
  13. 13. S Dharmapurikar,P Krishnamurthy,T Sproull,J Lockwood (2004). Deep packet inspection using parallel bloom filters. IEEE Micro, 24(1), 52-61.
  14. 14. J Nandhini,Dr Nithya,Dr Prabhakaran (2019). ADVANCE VIRUS DETECTION USING COMBINED TECHNIQUES OF PATTERN MATCHING AND DYNAMIC INSTRUCTION SEQUENCES. International Journal of communication and computer Technologies, 1(1), 156-161.
  15. 15. O Safaa,Al-Mamory String Matching Enhancement for Snort IDS. String Matching Enhancement for Snort IDS, 1020-1023.
  16. 16. S Dharmapurikar,J Lockwood (2006). Fast and Scalable Pattern Matching for Network Intrusion Detection Systems. IEEE Journal on Selected Areas in Communications, 24(10), 1781-1792.
  17. 17. N Hua,H Song,T Lakshman (2009). Variablestride multipattern matching for scalable deep packet inspection. Proc. of INFOCOM, 415-423.
  18. 18. H Lu,K Zheng,B Liu,X Zhang,Y Liu (2006). A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection. IEEE Journal on Selected Areas in Communications, 24(10), 1793-1804.
  19. 19. B Brodie,D Taylor,R Cytron (2006). A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching. 33rd International Symposium on Computer Architecture (ISCA'06), 191-202.
  20. 20. D Ficara,G Antichi,A Di Pietro,S Giordano,G Procissi,F Vitucci (2010). Sampling Techniques to Accelerate Pattern Matching in Network Intrusion Detection Systems. 2010 IEEE International Conference on Communications, 1-5.
  21. 21. Wang Xiaofei,Hu Chengchen,Yi,Ting,Liu Wu Chunming,Bin,Wang Xiaojun (2012). Parallel Length-based Matching Architecture for High Throughput Multi-Pattern Matching. Chinese Journal of Electronics, 21(3), 489-494.
  22. 22. Hyunjin Kim,Seung-Woo Lee (2013). A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection. ETRI Journal, 35(1), 154-157.
  23. 23. Akhtar Rasool,Nilay Khare (2012). Parallelization of KMP String Matching Algorithm on Different SIMD Architectures: Multi-Core and GPGPU's. International Journal of Computer Applications, 49(11), 26-28.
  24. 24. Cheng Zhong,Guo-Liang Chen (2007). A Fast Determinate String Matching Algorithm for the Network Intrusion Detection Systems. 2007 International Conference on Machine Learning and Cybernetics, 3173-3177.
  25. 25. Panwei Cao,Suping Wu (2011). Parallel Research on KMP Algorithm. Parallel Research on KMP Algorithm, 4252-4255.
  26. 26. Wei Lin,Bin Liu (2008). Pipelined Parallel AC-Based Approach for Multi-String Matching. 2008 14th IEEE International Conference on Parallel and Distributed Systems, 665-672.
  27. 27. Chuanpeng Chen,Zhongping Qin (2009). A bit-split byte-parallel string matching architecture. 2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 214-217.
  28. 28. Hyunjin Kim,Hyejeong Hong,Hong-Sik Kim,Sungho Kang (2009). A Memory-Efficient Parallel String Matching for Intrusion Detection Systems. IEEE COMMUNICATIONS LETTERS, 13(12), 1004-1006.
  29. 29. Mansoor Alicherry,M Muthuprasanna,Vijay Kumar (2006). High Speed Pattern Matching for Network IDS/IPS. Proceedings of the 2006 IEEE International Conference on Network Protocols, 187-196.
  30. 30. D Pao,W Lin,B Liu (2010). A memory-efficient pipelined implementation of the Aho-Corasick string-matching algorithm. ACM Trans. on Archit. Code Optim, 7, 1-27.
  31. 31. Wei Lin,Bin Liu (2008). Pipelined Parallel AC-Based Approach for Multi-String Matching. 2008 14th IEEE International Conference on Parallel and Distributed Systems, 665-672.
  32. 32. N Hua,H Song,T Lakshman (2009). Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection. IEEE INFOCOM 2009, 415-423.
  33. 33. D Scarpazza,O Villa,F Petrini (2008). Exact multipattern string matching on the cell/b.e. processor. Exact multipattern string matching on the cell/b.e. processor
  34. 34. Yutaka Sugawara,Mary Inaba,Kei Hiraki (2004). Over 10Gbps String Matching Mechanism for Multi-stream Packet Scanning Systems. Lecture Notes in Computer Science, 3203, 484-493.
  35. 35. Hyunjin Kim (2010). A Memory-Efficient Bit-Split Parallel String Matching using Pattern Dividing for Intrusion Detection Systems. IEEE Transactions On Parallel And Distributed Systems, 1-8.
  36. 36. E Yi-Hua,Yang,K Viktor,Prasanna (2012). Robust and Scalable String Pattern Matching for Deep Packet Inspection on Multi-core Processors. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1-11.
  37. 37. Yi Tang,Junchen Jiang,Xiaofei Wang,Bin Liu,Yang Xu (2010). Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching. 2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 1-5.
  38. 38. S Ksmv Kumar,A Viswanadha Raju,Govardhan (2013). Overlapped Text Partition Algorithm for Pattern Matching on Hypercube Networked Model. GJCST, 1-8.
  39. 39. Benben Yao Xin,Liu,Willx Biao Min,Li,C Ray,Anthony Cheung,Ting Fong,Chan Fung (2013). Parallel architecture for DNA sequence inexact matching with Burrows-Wheeler Transform. Microelectronics Journal, 670-682.
  40. 40. Hoang Le,Viktor Prasanna (2013). A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching. IEEE Transactions on Computers, 62(5), 844-857.
  41. 41. Tan Jianlong (2011). Speeding up Pattern Matching by Optimal Partial String Extraction. the first international workshop on security in computers, networking and communications, 1030-1035.
  42. 42. Rajesh Prasad,Suneeta Agarwal,Ishadutta Yadav,Bharat Singh (2011). Efficient bit-parallel multi-patterns string matching algorithms for limited expression. Proceedings of the Third Annual ACM Bangalore Conference, 6, 1-6.
  43. 43. M Mosleh,Abu-Alhaj (2010). An Innovative Platform To Improve The Performance Of Exact-String Matching ALGORITHMS. IJCSIS) International Journal of Computer Science and Information Security, 7(1), 280-283.
  44. 44. Benedikt Forchhammer,Thorsten Papenbrock,Thomas Stening,Sven Viehmeier,Uwe Draisbach,Felix Naumann (2013). Duplicate Detection on GPUs. Duplicate Detection on GPUs, 165-188.
  45. 45. Antonino Tumeo,Oreste Villa,Daniel Chavarria-Miranda (2011). Aho-Corasick String Matching on Shared and Distributed-Memory Parallel Architectures. IEEE Transactions on Parallel and Distributed Systems, 23(3), 436-443.
  46. 46. Antonino Tumeo,Oreste Villa,Daniel Chavarria-Miranda (2012). Aho-Corasick String Matching on Shared and Distributed-Memory Parallel Architectures. IEEE Transactions on Parallel and Distributed Systems, 23(3), 436-443.
  47. 47. B Vinod,Sagar (2013). Hash-Based String Matching Algorithm For Network Intrusion Prevention systems (NIPS). International Journal of Advanced Computer Theory and Engineering, 2(2), 31-35.
  48. 48. Oren Ben-Kiki,Philip Bille,Dany Breslauer,Leszek Gasieniec,Roberto Grossi,Oren Weimann (2013). Towards Optimal Packed String Matching. Towards Optimal Packed String Matching, 1-33.
  49. 49. H Cheng,K Fu (1987). VLSI architectures for string matching and pattern matching. Pattern Recognition, 20(1), 125-141.
  50. 50. P Daniel,Lopresti (1987). P-NAC : A Systolic Array for Comparing Nucleic Acid Sequences. Computer, 98-99.
  51. 51. Amar Mukhopadhyay (1979). Hardware Algorithms for Nonnumeric Computation. IEEE trans. on Computers, 28(6), 384-394.
  52. 52. Bradly Fawcett (1995). Emms, Peter Fawcett, (born 25 April 1935), public administration consultant in former communist countries, 1995. Electronic Engineering Times, 64.
  53. 53. Foster,Kung (1980). The Design of Special-Purpose VLSI Chips. Computer, 13(1), 26-40.
  54. 54. Carla Correa Tavares Dos Reis,Oswaldo Cruz (2005). Approximate String Matching Algorithm Using Parallel Methods for Molecular Sequence Camparisons. IEEE, 140-143.
  55. 55. Muhammad Zubair,Fazal Wahab,Iftikhar Hussain,Muhammad Ikram (2010). Text scanning approach for exact string matching. 2010 International Conference on Networking and Information Technology, 118-122.
  56. 56. I Tomohiro,Shunsuke Inenaga,Masayuki Takeda (2013). Palindrome pattern matching. Theoretical Computer Science, 162-170.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

K Butchi Raju. 2013. "A Parallel Computational Approach for String Matching- A Novel Structure with Omega Model". Global Journal of Computer Science and Technology GJCST-C Volume 13 (GJCST Volume 13 Issue C12).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification C.1.4
Version of record
v1.2

Issue date
December 28, 2013

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2.1K
Total Downloads: 194
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Parallel Computational Approach for String Matching- A Novel Structure with Omega Model

K Raju
K Raju GRIET AFF TO JNTUH