Skip to main content

Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform

  • Conference paper
  • 734 Accesses

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

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.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. 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

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

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