Implementation of character string pattern matching on a multiprocessor

  • Authors:

  • Maniel Vineberg

  • Affiliations:

  • Naval Ocean Systems Center, San Diego, California

  • Venue:
  • CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

An algorithm to do pattern matching, a basic character string operation, is presented. The Programmable Algorithm Machine (PAM), a proposed special-purpose computer which will feature multiple processing elements and operate efficiently over a wide class of applications, is described. It is shown that the multiple processing elements of the PAM allow concurrent execution of independent operations both in a special case of the pattern matching algorithm, where the string sizes (lengths) are known at compile time, and in the general case, where the sizes are not known.