Skip to main content

paradeis: An Object Library for Parallel Sparse Array Computation

  • Conference paper
  • First Online:
Parallel Computation (ACPC 1999)

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

  • 395 Accesses

Abstract

Parallel programming of sparse data structure has been recognized to be hard to debug and to require an excessive amount of development time. The paradeis library (PARAllel Data Environment for Irregular Structure) is an object library that aims at providing a dataparallel approach with object oriented languages to ease the treatment of the sparse data structure for SPMD-like programs on Massively Parallel Processors (MPPs) with distributed memory. This paper focuses on the core of communication layout: the conversion of global addresses to communications, and its relationship with partitioning strategies.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Andr, O. Chron, M. LeFur, Y. Maho, and J.L. Pazat. Programmation des machines mmoire distribue par distribution de donnes: langages et compilateurs. T.S.I, 12(5):563–597, 1993.

    Google Scholar 

  2. M.J. Berger and S.H. Bokhari. A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comput., 36(5):570–580, 1987.

    Article  Google Scholar 

  3. A.J.C Bik and H.A.G Wijshoff. Automatic data structure selection and transformation for sparse matrix computation. IEEE Transactions on Parallel and Distributed Systems, 7(2):1–19, 1996.

    Article  Google Scholar 

  4. F. Coelho, C. Germain, and J.L. Pazat. State of art in compiling HPF. In The Data Parallel Programming Model, volume LNCS 1132, pages 104–130. Springer, 1996.

    Google Scholar 

  5. I.S Duff, A.M Erisman, and J.K. Reid. Direct Methods for Sparse Matrices Oxford Sciences Publications, 1986.

    Google Scholar 

  6. R. Ponnusamy, Y. Hwang, J.H. Saltz, A. Choudhary, and G. Fox. Supporting irregular distributions using data-parallel languages. IEEE Parallel and Distributed Technology, pages 12–24, Spring 1995.

    Google Scholar 

  7. M Ujaldon, E.L. Zappata, B.M. Chapman, and P.H. Zima. Vienna-Fortran/HPF extension for sparse and irregular problems and their compilation. IEEE Trans. on Parallel & Distributed systems, 8(10):1068–1082, October 1997.

    Google Scholar 

  8. R. von Hanxleden, K. Kennedy, C. Koelbel, R. Das, and J. Saltz. Compiler analysis for irregular problems in Fortran D. Lecture Notes in Computer Science, 757:97–111, 1993.

    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

Delaplace, F., Remy, D. (1999). paradeis: An Object Library for Parallel Sparse Array Computation. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-49164-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65641-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics