Open AccessExperiments with a fast String: Searching Algorithm
Author(s) -
Peter Møller-Nielsen,
Jørgen Staunstrup
Publication year - 1983
Publication title -
daimi report series
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v12i167.7441
Subject(s) - multiprocessing , string (physics) , computer science , simple (philosophy) , algorithm , parallel computing , mathematics , philosophy , epistemology , mathematical physics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom