Skip to main content
Published Online:pp 45-59

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.


string matching, parallel computation, heterogeneous cluster architecture, heterogeneous workstations, performance evaluation, parallel text searching