Skip to main content

Heterogeneous distribution of computations while solving linear algebra problems on networks of heterogeneous computers

  • Track C2: Computational Science
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1999)

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

Included in the following conference series:

Abstract

The paper presents a heterogeneous distribution of computations while solving dense linear algebra problems on heterogeneous networks of computers. The distribution is based on heterogeneous block cyclic distribution which is extension of the traditional homogeneous block cyclic distribution taking into account differences in the processor performances. The mpC language, specially designed for parallel programming heterogeneous networks is briefly introduced. An mpC aplication carring out Cholesky factorization on a heterogenous network of workstations is used to demonstrate that the heterogeneous distribution have an essential advantage over the traditional homogeneous distribution.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. S. Blackford, A. Cleary, J. Demmel, I. Dhillon, J. Dongarra S. Hammarling, A. Petitet, H. Ren, K. Stanley, and R. C. Whaley Practical Experience in the Dangers of Heterogeneous Computing UT, CS-96-330, July 1996.

    Google Scholar 

  2. D. Arapov, A. Kalinov, A. Lastovetsky, I. Ledovskih, and T. Lewis “A Programming Environment for Heterogeneous Distributed Memory Machines”, Proceedings of the Sixth Heterogeneous Computing Workshop (HCW'97), IEEE Computer Society Press, Geneva, Switzerland, April 1, 1997.

    Google Scholar 

  3. A. Lastovetsky, The mpC Programming Language Specification. Technical Report, ISPRAS, Moscow, December 1994.

    Google Scholar 

  4. B. Hendrickson and D. Womble,” The Torus-wrap Mapping for Dense Matrix Calculations on Massively Parallel Computers”, SIAMSSC, 15(5), 1994.

    Google Scholar 

  5. J. Choi, J. J. Dongarra, S. Ostrouchov, A. P. Petitet, D. W. Walker, and R. C. Whaley “The Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines” UT, CS-94-246, September, 1994.

    Google Scholar 

  6. D.Arapov, A. Kalinov, A. Lastovetsky and I. Ledovskih “Experiments with mpC: Efficient Solving Regular Problems on Heterogeneous Networks of Computers via Irregularization”, Proceedings of the Fifth International Symposium on Solving Irregularty Structure Problems in Parallel (IRREGULAR'98), Lecture Notes in Computer Science 1457, Berkley, CA, USA, August 9–11, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter Sloot Marian Bubak Alfons Hoekstra Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Kolinov, A., Lastovetsky, A. (1999). Heterogeneous distribution of computations while solving linear algebra problems on networks of heterogeneous computers. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0100580

Download citation

  • DOI: https://doi.org/10.1007/BFb0100580

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65821-4

  • Online ISBN: 978-3-540-48933-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics