Performance analysis of approximate string searching implementations for heterogeneous computing platform

Author

Michailidis, Panagiotis D. ; Margaritis, Konstantinos G.

Author_Institution

Dept. of Appl. Informatics, Macedonia Univ., Thessaloniki, Greece

fYear

2003

fDate

6-9 Oct. 2003

Firstpage

173

Lastpage

180

Abstract

This paper presents an analytical performance prediction model that can be used to predict the execution time, speedup and similar performance metrics of four approximate string searching implementations running on an MPI cluster of heterogeneous workstations. The four implementations are based on master-worker model using static and dynamic allocation of the text collection. The developed performance model has been validated on an 8-cluster of heterogeneous workstations and it has been shown that the model is able to predict the execution time and other performance metrics of four parallel implementations accurately.

Keywords

dynamic programming; message passing; performance evaluation; resource allocation; string matching; tree searching; workstation clusters; MPI cluster; approximate string searching; dynamic allocation; execution time; heterogeneous computing; heterogeneous workstations; performance analysis; performance metrics; performance prediction; speedup; static allocation; text collection; Biological system modeling; Clustering algorithms; Concurrent computing; Distributed computing; Distributed processing; Distribution strategy; Measurement; Performance analysis; Predictive models; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

ISSN

1530-2016

Print_ISBN

0-7695-2018-9

Type

conf

DOI

10.1109/ICPPW.2003.1240368

Filename

1240368