Parallel text searching applications on a heterogeneous cluster architecture

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, 54006 Thessaloniki, Greece.;Parallel and Distributed Processing Laboratory, Department of Applied Informatics, University of Macedonia, 156 Egnatia str., P.O. Box 1591, 54006 Thessaloniki, Greece
Venue:
International Journal of Computational Science and Engineering
Year:
2005

Citing 13
Cited 0

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
An effective and practical performance prediction model for parallel computing on nondedicated heterogeneous NOW

Journal of Parallel and Distributed Computing
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
A Case for NOW (Networks of Workstations)

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

Neural, Parallel & Scientific Computations
The Design of Special-Purpose VLSI Chips

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose four text searching implementations on a cluster of heterogeneous workstations using MPI message passing library. The first three parallel implementations are based on the static and dynamic master-worker methods. Further, we propose a hybrid parallel implementation that combines the advantages of static and dynamic parallel methods in order to reduce the load imbalance and communication overhead. We test these parallel implementations and present experimental results for different text sizes and number of workstations. We also propose a performance prediction model of the four implementations that agrees well with our experimental measurements.