Analysis of Parallel Boyer-Moore String Search Algorithm

1
Abdulellah A.Alsaheel, Abdullah H.Alqahtani
Abdulellah A.Alsaheel, Abdullah H.Alqahtani
2
Abdulellah A. Alsaheel
Abdulellah A. Alsaheel
3
Abdullah H. Alqahtani
Abdullah H. Alqahtani
4
Abdulatif M. AlAbdulatif
Abdulatif M. AlAbdulatif
1 King Saud University

Send Message

To: Author

GJCST Volume 13 Issue A1

Article Fingerprint

ReserarchID

272TK

Analysis of Parallel Boyer-Moore String Search Algorithm Banner
  • 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

Boyer Moore string matching algorithm is one of the famous algorithms used in string search algorithms. Widely, it is used in sequential form which presents good performance. In this paper a parallel implementation of Boyer Moore algorithm is proposed and evaluated. Experimental results show that it is valuable with zero overhead and cost optimal. The comparison between sequential and parallel showed that the parallel implementation was faster and more useful.

6 Cites in Articles

References

  1. R Boyer,J Moore (1977). A fast string searching algorithm.
  2. P,K Panicker (2010). Single Pattern Search Implementations in a Cluster Computing Environment.
  3. Dany Breslauer,Zvi Galil (1993). Parallel string matching algorithms.
  4. Z Galil (1979). On improving the worst case running time of the Boyer-Moore string matching algorithm.
  5. R Cole (1991). Tight bounds on the complexity of the Boyer-Moors string matching algorithm.
  6. A Grama,G Karypis,V Kumar,A Gupta (2003). Introduction to parallel computing.

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.

Abdulellah A.Alsaheel, Abdullah H.Alqahtani. 2013. \u201cAnalysis of Parallel Boyer-Moore String Search Algorithm\u201d. Global Journal of Computer Science and Technology - A: Hardware & Computation GJCST-A Volume 13 (GJCST Volume 13 Issue A1): .

Download Citation

Issue Cover
GJCST Volume 13 Issue A1
Pg. 43- 47
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

August 1, 2013

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 9789
Total Downloads: 2455
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Boyer Moore string matching algorithm is one of the famous algorithms used in string search algorithms. Widely, it is used in sequential form which presents good performance. In this paper a parallel implementation of Boyer Moore algorithm is proposed and evaluated. Experimental results show that it is valuable with zero overhead and cost optimal. The comparison between sequential and parallel showed that the parallel implementation was faster and more useful.

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]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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.

Analysis of Parallel Boyer-Moore String Search Algorithm

Abdulellah A. Alsaheel
Abdulellah A. Alsaheel
Abdullah H. Alqahtani
Abdullah H. Alqahtani
Abdulatif M. AlAbdulatif
Abdulatif M. AlAbdulatif

Research Journals