Skip to main content
Log in

String Search in Coarse-Grained Parallel Computers

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

Given a text string T[1,n] , the multistring search problem consists of determining which of k pattern strings {X 1 [1,m], X 2 [1,m], . . ., X k [1,m]} , provided on-line, occur in T . We study this problem in the BSP model [27], and then extend our analysis to other coarse-grained parallel computational models. We refer to the relevant and difficult case of long patterns, that is mp , where p is the number of available processors, and provide an optimal result with respect to both computation and communication times, attaining a constant number of supersteps. We then study single string search (i.e., k=1 ), and show how the multistring search algorithm can be employed to speed up the process and balance the communication cost. The proposed solution takes a constant number of supersteps, and achieves optimal communication time if the string to be searched is longer than p 2 . Our results are based on the distribution of a proper data structure among the p processors, to reduce and balance the communication cost. We also indicate how short patterns can be efficiently dealt with, through a completely different algorithmic approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received June 1, 1997; revised March 10, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ferragina, P., Luccio, F. String Search in Coarse-Grained Parallel Computers . Algorithmica 24, 177–194 (1999). https://doi.org/10.1007/PL00008259

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00008259

Navigation