Parallel implementations for string matching problem on a cluster of distributed workstations

Authors:
Panagiotis D. Michailidis;Konstantinos G. Margaritis
Affiliations:
Parallel and Distributed Processing Laboratory, Department of Applied Informatics, University of Macedonia, 156 Egnatia str., P.O. Box 1591, GR-54006 Thessaloniki, Greece;Parallel and Distributed Processing Laboratory, Department of Applied Informatics, University of Macedonia, 156 Egnatia str., P.O. Box 1591, GR-54006 Thessaloniki, Greece
Venue:
Neural, Parallel & Scientific Computations
Year:
2002

Citing 11
Cited 1

Efficiency of text scanning in bibliographic databases using microprocessor-based, multiprocessor networks

Journal of Information Science
The C programming language

The C programming language
Network design for the implementation of text searching using a multicomputer

Information Processing and Management: an International Journal - Special issue on parallel processing and information retrieval
A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
String searching algorithms

String searching algorithms
Text algorithms

Text algorithms
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
Parallel programming with MPI

Parallel programming with MPI
Parallel programming: techniques and applications using networked workstations and parallel computers

Parallel programming: techniques and applications using networked workstations and parallel computers
MPI: The Complete Reference

MPI: The Complete Reference

Parallel text searching applications on a heterogeneous cluster architecture

International Journal of Computational Science and Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present three parallel implementations for solving the string matching problem. The advantages of these three parallel implementations are combined and incorporated into our new hybrid parallel implementation to produce optimal performance than either of the original three. We compare the performance of the four implementations on a cluster of workstations, interconnected by a high-performance Fast Ethernet network. Moreover, we have checked that by using the theoretical performance model we can predict the behaviour of the experimental results of the parallel string matching implementations.