Skip to main content

Sparse computations with Pei

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

  • 105 Accesses

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. R. Barrett, M. Berry, T.F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. Van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd Edition. SIAM, Philadelphia, PA, 1994.

    Google Scholar 

  2. A. Bik and H. Wijshoff. Advanced compiler optimizations for sparse computations. J. of Parallel and Distributed Computing, 31:14–24, 1995.

    Article  Google Scholar 

  3. Aart J. C. Bik and Harry A. G. Wijshoff. Automatic data structure selection and transformation for sparse matrix computations: IEEE Transactions on Parallel and Distributed Systems, 7(2):109–126, February 1996. also on LNCS.

    Article  Google Scholar 

  4. I. S. Duff, R. G. Grimes, and J. G. Lewis. User’s guide for Harwell-Boeing sparse matrix test problems collection. Tech. Report RAL-92-086, Computing and Information Systems Department, Rutherford Appleton Laboratory, Didcot, UK, 1992.

    Google Scholar 

  5. Stéphane Genaud. On deriving HPF code from pei programs. Technical Report RR97-04, ICPS, September 1997.

    Google Scholar 

  6. V. Kotlyar, K. Pingali, and P. Stodghill. A relational approach to the compilation of sparse matrix programs. Lecture Notes in Computer Science, 1300:318-, 1997.

    Article  MATH  Google Scholar 

  7. Serge Petiton and Nahid Emad. The data parallel programming model: foundations, HPF realization, and scientific applications, chapter A data parallel scientific computing introduction pages 45–64. Springer-Verlag Inc., 1996.

    Google Scholar 

  8. E. Violard and G.-R. Perrin. Pei: a language and its refinement calculus for parallel programming. Parallel Computing, 18:1167–1184, 1992.

    Article  MATH  Google Scholar 

  9. E. Violard and G.-R. Perrin. Pei: a single unifying model to design parallel programs. PARLE’93, LNCS 694:500–516, 1993.

    Google Scholar 

  10. E. Violard and G.-R. Perrin. Reduction in pei. CONPAR’94, LNCS 854, pages 112–123, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Voisin, F., Perrin, GR. (1999). Sparse computations with Pei . In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097985

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics