main page  —  COMP 526 Applied Algorithmics

Unit 5: Parallel String Matching

This is an archived version of this module from Spring 2022.
Click here for the current iteration.

This unit covers some algorithms for exact string matching on parallel computers:

  • exploiting embarrassingly parallel problems
  • sequential matching by duels
  • parallel matching my duels

Learning outcomes

  1. Know and apply parallelization strategies for embarrassingly parallel problems.
  2. Identify limits of parallel speedups.
  3. Understand string matching by duels, both sequential and parallel (excluding preprocessing).


Further reading and sources

The presentation of sequential and parallel matching by duels takes inspiration from:

Unit 4  ⋅  Syllabus  ⋅  Unit 6