Skip to main content

Porting generalized eigenvalue software on distributed memory machines using systolic model principles

  • Conference paper
  • First Online:
Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 1999)

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

  • 437 Accesses

Abstract

This paper deals with the issue of porting sequential application on distributed memory machines. Three constraints direct the selection of the parallelization paradigm: little rewriting of the non-parallel source code, portability on several distributed memory machines and the overheads due to data and computation partitioning. The parallelization paradigm found to be most effective for our software on distributed memory machine was to provide the user with a client/server architecture.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J-C. Bermond, C. Peyrat, I. Sakho, and M. Thuenté. Parallelization of the gaussian elimination algorithm on systolic arrays. Journal of parallel and distributed computing, 33:69–75, 1996.

    Article  Google Scholar 

  2. F. Chatelin. Valeurs Propres de Matrices. Masson, 1988.

    Google Scholar 

  3. J.H Moreno and T. Lang. Graph-based partitioning for matrix algorithms for systolic arrays: Application to transitive closure. ICPP, 1:28–31, 1988.

    Google Scholar 

  4. D.I Moldovan. On the design of algorithms for vlsi systolic arrays. Proc.IEEE, 71:113–120, 1983.

    Article  Google Scholar 

  5. W. L. Miranker and A. Winkler. Space-time representation of computational structures. Computing, 32:93–114, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Quinton. The systematic design of systolic arrays. Technical Report 193, IRISA, 1983.

    Google Scholar 

  7. J. Ramanujam and P. Sadayappan. Tiling multidimensional iteration spaces for multicomputers. Journal of Parallel and Distributed Computing, 16(2):108–120, October 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bassomo, P., Sakho, I., Corbel, A. (1999). Porting generalized eigenvalue software on distributed memory machines using systolic model principles. In: Dongarra, J., Luque, E., Margalef, T. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1999. Lecture Notes in Computer Science, vol 1697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48158-3_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-48158-3_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66549-6

  • Online ISBN: 978-3-540-48158-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics