Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform

Michailidis, Panagiotis D.; Margaritis, Konstantinos G.

doi:10.1007/978-3-540-39924-7_36

Panagiotis D. Michailidis⁷ &
Konstantinos G. Margaritis⁷

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2840))

Included in the following conference series:

European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting

735 Accesses

Abstract

This paper presents an analytical performance prediction model that can be used to predict the 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 a 8-cluster of heterogeneous workstations and it has been shown that the model is able to predict the speedup of four parallel implementations accurately.

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

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 84.99; Price excludes VAT (USA)

Softcover Book: USD 109.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

Michailidis, P.D., Margaritis, K.G.: A Performance study of load balancing strategies for approximate string matching on an MPI heterogeneous system environment. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J., Volkert, J. (eds.) PVM/MPI 2002. LNCS, vol. 2474, pp. 432–440. Springer, Heidelberg (2002)
Chapter Google Scholar
Sellers, P.H.: The theory and computations of evolutionaly distances: pattern recognition. Journal of Algorithms 1, 359–373 (1980)
Article MATH MathSciNet Google Scholar

Download references

Author information

Authors and Affiliations

Parallel and Distributed Processing Laboratory, Department of Applied Informatics, University of Macedonia, 156 Egnatia str., P.O. Box 1591, 54006, Thessaloniki, Greece
Panagiotis D. Michailidis & Konstantinos G. Margaritis

Authors

Panagiotis D. Michailidis
View author publications
You can also search for this author in PubMed Google Scholar
Konstantinos G. Margaritis
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA
Jack Dongarra
Information Science and Technologies Institute (ISTI), The Italian National Research Council (CNR), Area della Ricerca, Via Giuseppe Moruzzi, 1, I-56126, Pisa, Italy
Domenico Laforenza
Department of Computer Science, Ca’ Foscari University of Venice, Italy
Salvatore Orlando

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Michailidis, P.D., Margaritis, K.G. (2003). Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_36

Download citation

DOI: https://doi.org/10.1007/978-3-540-39924-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics