A Frame Work for Parallel String Matching- A Computational Approach with Omega Model

α
K Butchi Raju
K Butchi Raju
σ
Chinta Someswara Rao
Chinta Someswara Rao
ρ
Dr. S. Viswanadha Raju
Dr. S. Viswanadha Raju
α Jawaharlal Nehru Technological University, Hyderabad
σ Andhra University Andhra University

Send Message

To: Author

A Frame Work for Parallel String Matching- A Computational Approach with Omega Model

Article Fingerprint

ReserarchID

0PNA0

A Frame Work for Parallel String Matching- A Computational Approach 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

Abstract

Now a day’s parallel string matching problem is attracted by so many researchers because of the importance in information retrieval systems. 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. 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 by more than 40%.

References

30 Cites in Article
  1. Chinta Someswararao (2013). Parallel String Matching with Multi Core Processors-A Comparative Study for Gene Sequences.
  2. K Grabowski,S (2009). Average-Optimal String Matching.
  3. Luis Russo,L Navarro,G Oliveira,A Morales,P (2009). Approximate String Matching with Compressed Indexes Algorithm.
  4. L Ilie,G Navarro,L Tinta (2010). The Longest Common Extension Problem, Revisited and Applications to Approximate String Searching.
  5. K Fredriksson,S Grabowski (2009). Average-Optimal String Matching.
  6. Z Galil (1984). Optimal parallel algorithms for string matching.
  7. Uzi Vishkin (1985). Optimal parallel pattern matching in strings.
  8. Y Takefuji,T Tanaka,K Lee (1992). A parallel string search algorithm.
  9. Lin-Jie Chen Guo-Liang,Gu Nai-Jie (2000). Design and analysis of string matching algorithm on distributed memory machine.
  10. S Viswanadha Raju,A Vinaya Babu,M Mrudula (2006). Backend Engine for Parallel String Matching Using Boolean Matrix.
  11. Bi Kun,Gu Nai-Jie,Tu Kun,Liu Xiao-Hu,Liu Gang,A (2005). Practical Distributed String Matching Algorithm Architecture and Implementation World Academy of Science.
  12. Hsi-Chieh Lee,F Ercal (1997). RMESH algorithms for parallel string matching.
  13. S Viswanadha Raju,A Vinayababu (2006). Optimal Parallel algorithm for String Matching on Mesh Network Structure.
  14. M Its'hak Dinstein,Landau (1990). Using Parallel String Matching Algorithms for Contour Based 2-D Shape Recognition.
  15. Jin Hwan,Park,K George (1999). Parallel String Matching Algorithms Based on Dataflow.
  16. S Viswanadha Raju S R Mantena,A Vinaya Babu,G V S Raju (2006). Efficient Parallel Pattern Matching using Partition Method.
  17. Chuanpeng Chen,Zhongping Qin (2009). A bit-split byte-parallel string matching architecture.
  18. Qingbo Wang,K Viktor,Prasanna (2009). Multi-Core Architecture on FPGA for Large Dictionary String Matching.
  19. S Muthukrishnan (1997). Detecting False Matches in String-Matching Algorithms.
  20. S Viswanadha Raju,A Vinaya,G Babu,K Raju,Madhavi (2007). W-Period Technique for Parallel String Matching.
  21. Ajay Kshemkalyani,Mukesh Singhal (2008). Distributed Computing.
  22. S Viswanadha Raju,A Vinayababu (2004). Performance in the design of Parallel Programming.
  23. S Viswanadha Raju,A Vinayababu,S Yanaiah,Gvsraju (2006). Parallel Approach for K String Matching.
  24. John Garofalakis,Eleftherios Stergiou (2008). An Analytical Performance Model for Multistage Interconnection Networks with Blocking.
  25. Josep Torrellas,Zheng Zhang (1997). The Performance of the Cedar Multistage Switching Network.
  26. S Bhogavilli,H Abu-Amara (1997). Design and analysis of high performance multistage interconnection networks.
  27. L Goke,G Lipovski (1973). Banyan networks for partitioning multiprocessor systems.
  28. D Lawrie (1975). Access and Alignment of Data in an Array Processor.
  29. Janak Patel (1979). Processor-memory interconnections for multiprocessors.
  30. Adams,Siegel (1982). The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems.

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. 2014. \u201cA Frame Work for Parallel String Matching- A Computational Approach with Omega Model\u201d. Global Journal of Computer Science and Technology - A: Hardware & Computation GJCST-A Volume 13 (GJCST Volume 13 Issue A2): .

Download Citation

Issue Cover
GJCST Volume 13 Issue A2
Pg. 13- 20
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

January 28, 2014

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: 9076
Total Downloads: 2339
2026 Trends
Related Research

Published Article

Now a day’s parallel string matching problem is attracted by so many researchers because of the importance in information retrieval systems. 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. 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 by more than 40%.

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 Frame Work for Parallel String Matching- A Computational Approach with Omega Model

K Butchi Raju
K Butchi Raju Jawaharlal Nehru Technological University, Hyderabad
Chinta Someswara Rao
Chinta Someswara Rao Andhra University
Dr. S. Viswanadha Raju
Dr. S. Viswanadha Raju

Research Journals