Experiments with a fast String: Searching Algorithm

Authors

  • Peter Møller-Nielsen
  • Jørgen Staunstrup

DOI:

https://doi.org/10.7146/dpb.v12i167.7441

Abstract

Consider the problem of finding the first occurrence of a particular pattern in a (long) string of characters. Boyer and Moore found a fast algorithm for doing this. Here we consider how this algorithm behaves when executed on a multiprocessor.

It is shown that a simple implementation performs very well. This claim is based on experiments performed on the Multi-Maren multiprocessor.

Author Biographies

Peter Møller-Nielsen

Jørgen Staunstrup

Downloads

Published

1983-10-01

How to Cite

Møller-Nielsen, P., & Staunstrup, J. (1983). Experiments with a fast String: Searching Algorithm. DAIMI Report Series, 12(167). https://doi.org/10.7146/dpb.v12i167.7441

Issue

No. 167 (1983): PB-167 Experiments with a fast String Searching Algorithm

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.