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

K Butchi Raju
K Butchi Raju
Dr. S. Viswanadha Raju
Dr. S. Viswanadha Raju
Jawaharlal Nehru Technological University, Hyderabad

Send Message

To: Author

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

Article Fingerprint

ReserarchID

CSTSDE529J0

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

AI TAKEAWAY

Connecting with the Eternal Ground
  • 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
Font Type
Font Size
Font Size
Bedground

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. Chinta Someswararao,S Butchiraju,Viswanadharaju (2011). Recent Advancement is Parallel Algorithms for String matching on computing models -A survey and experimental results.
  2. Chinta Someswararao,S Butchiraju,Viswanadharaju (2011). PDM data classification from STEP-an object oriented String matching approach.
  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.
  4. Y Simon,M Inayatullah (2004). Improving Approximate Matching Capabilities for Meta Map Transfer Applications.
  5. Chinta Someswararao,S Butchiraju,Viswanadharaju (2012). Parallel Algorithms for String Matching Problem based on Butterfly Model.
  6. Chinta Someswararao,S Butchiraju,Viswanadharaju (2013). Recent Advancement is String matching algorithms-A survey and experimental results.
  7. S Raju (2012). parallel string matching algorithm using grid.
  8. Leslie Valiant (1990). A bridging model for parallel computation.
  9. I Foster (1996). Designing and Building Paral lel Programs.
  10. (1991). Argonne National Laboratory annual report of laboratory directed research and development program activities for FY 1995..
  11. J Darlington,M Ghanem,H To (1993). Structured parallel programming.
  12. N Tuck,T Sherwood,B Calder,G Varghese (2004). Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection.
  13. S Dharmapurikar,P Krishnamurthy,T Sproull,J Lockwood (2004). Deep packet inspection using parallel bloom filters.
  14. J Nandhini,Dr Nithya,Dr Prabhakaran (2019). ADVANCE VIRUS DETECTION USING COMBINED TECHNIQUES OF PATTERN MATCHING AND DYNAMIC INSTRUCTION SEQUENCES.
  15. O Safaa,Al-Mamory String Matching Enhancement for Snort IDS.
  16. S Dharmapurikar,J Lockwood (2006). Fast and Scalable Pattern Matching for Network Intrusion Detection Systems.
  17. N Hua,H Song,T Lakshman (2009). Variablestride multipattern matching for scalable deep packet inspection.
  18. H Lu,K Zheng,B Liu,X Zhang,Y Liu (2006). A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection.
  19. B Brodie,D Taylor,R Cytron (2006). A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching.
  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.
  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.
  22. Hyunjin Kim,Seung-Woo Lee (2013). A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection.
  23. Akhtar Rasool,Nilay Khare (2012). Parallelization of KMP String Matching Algorithm on Different SIMD Architectures: Multi-Core and GPGPU's.
  24. Cheng Zhong,Guo-Liang Chen (2007). A Fast Determinate String Matching Algorithm for the Network Intrusion Detection Systems.
  25. Panwei Cao,Suping Wu (2011). Parallel Research on KMP Algorithm.
  26. Wei Lin,Bin Liu (2008). Pipelined Parallel AC-Based Approach for Multi-String Matching.
  27. Chuanpeng Chen,Zhongping Qin (2009). A bit-split byte-parallel string matching architecture.
  28. Hyunjin Kim,Hyejeong Hong,Hong-Sik Kim,Sungho Kang (2009). A Memory-Efficient Parallel String Matching for Intrusion Detection Systems.
  29. Mansoor Alicherry,M Muthuprasanna,Vijay Kumar (2006). High Speed Pattern Matching for Network IDS/IPS.
  30. D Pao,W Lin,B Liu (2010). A memory-efficient pipelined implementation of the Aho-Corasick string-matching algorithm.
  31. Wei Lin,Bin Liu (2008). Pipelined Parallel AC-Based Approach for Multi-String Matching.
  32. N Hua,H Song,T Lakshman (2009). Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection.
  33. D Scarpazza,O Villa,F Petrini (2008). Exact multipattern string matching on the cell/b.e. processor.
  34. Yutaka Sugawara,Mary Inaba,Kei Hiraki (2004). Over 10Gbps String Matching Mechanism for Multi-stream Packet Scanning Systems.
  35. Hyunjin Kim (2010). A Memory-Efficient Bit-Split Parallel String Matching using Pattern Dividing for Intrusion Detection Systems.
  36. E Yi-Hua,Yang,K Viktor,Prasanna (2012). Robust and Scalable String Pattern Matching for Deep Packet Inspection on Multi-core Processors.
  37. Yi Tang,Junchen Jiang,Xiaofei Wang,Bin Liu,Yang Xu (2010). Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching.
  38. S Ksmv Kumar,A Viswanadha Raju,Govardhan (2013). Overlapped Text Partition Algorithm for Pattern Matching on Hypercube Networked Model.
  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.
  40. Hoang Le,Viktor Prasanna (2013). A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching.
  41. Tan Jianlong (2011). Speeding up Pattern Matching by Optimal Partial String Extraction.
  42. Rajesh Prasad,Suneeta Agarwal,Ishadutta Yadav,Bharat Singh (2011). Efficient bit-parallel multi-patterns string matching algorithms for limited expression.
  43. M Mosleh,Abu-Alhaj (2010). An Innovative Platform To Improve The Performance Of Exact-String Matching ALGORITHMS.
  44. Benedikt Forchhammer,Thorsten Papenbrock,Thomas Stening,Sven Viehmeier,Uwe Draisbach,Felix Naumann (2013). Duplicate Detection on GPUs.
  45. Antonino Tumeo,Oreste Villa,Daniel Chavarria-Miranda (2011). Aho-Corasick String Matching on Shared and Distributed-Memory Parallel Architectures.
  46. Antonino Tumeo,Oreste Villa,Daniel Chavarria-Miranda (2012). Aho-Corasick String Matching on Shared and Distributed-Memory Parallel Architectures.
  47. B Vinod,Sagar (2013). Hash-Based String Matching Algorithm For Network Intrusion Prevention systems (NIPS).
  48. Oren Ben-Kiki,Philip Bille,Dany Breslauer,Leszek Gasieniec,Roberto Grossi,Oren Weimann (2013). Towards Optimal Packed String Matching.
  49. H Cheng,K Fu (1987). VLSI architectures for string matching and pattern matching.
  50. P Daniel,Lopresti (1987). P-NAC : A Systolic Array for Comparing Nucleic Acid Sequences.
  51. Amar Mukhopadhyay (1979). Hardware Algorithms for Nonnumeric Computation.
  52. Bradly Fawcett (1995). Emms, Peter Fawcett, (born 25 April 1935), public administration consultant in former communist countries, 1995.
  53. Foster,Kung (1980). The Design of Special-Purpose VLSI Chips.
  54. Carla Correa Tavares Dos Reis,Oswaldo Cruz (2005). Approximate String Matching Algorithm Using Parallel Methods for Molecular Sequence Camparisons.
  55. Muhammad Zubair,Fazal Wahab,Iftikhar Hussain,Muhammad Ikram (2010). Text scanning approach for exact string matching.
  56. I Tomohiro,Shunsuke Inenaga,Masayuki Takeda (2013). Palindrome pattern matching.

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. \u201cA Parallel Computational Approach for String Matching- A Novel Structure with Omega Model\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 13 (GJCST Volume 13 Issue C12).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date
December 28, 2013

Language
en
Experiance 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: 9403
Total Downloads: 2468
2026 Trends
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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 Butchi Raju
K Butchi Raju <p>Jawaharlal Nehru Technological University, Hyderabad</p>
Dr. S. Viswanadha Raju
Dr. S. Viswanadha Raju

Research Journals