Article Fingerprint
ReserarchID
0PNA0
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%.
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): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
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.
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.
Total Score: 108
Country: India
Subject: Global Journal of Computer Science and Technology - A: Hardware & Computation
Authors: K Butchi Raju, Chinta Someswara Rao, Dr. S. Viswanadha Raju (PhD/Dr. count: 1)
View Count (all-time): 273
Total Views (Real + Logic): 9076
Total Downloads (simulated): 2339
Publish Date: 2014 01, Tue
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
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%.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.