Skip to main content

Extending Data-Parallel Languages for Irregularly Structured Applications

Parallelization of Sparse Matrix Algebra and Unstructured Domains solvers

  • Chapter
Advances in High Performance Computing

Part of the book series: NATO ASI Series ((ASHT,volume 30))

  • 128 Accesses

Abstract

Over the past few years, there have been major efforts in developing programming languages and compiler support for distributed memory machines. These languages provide mechanisms which distribute large data arrays across a set of processors. Languages such as Vienna-Fortran, Fortran-D and HPF follow this approach. Existing prototype compilers such as the Vienna-Fortran Compilation System, produce single-program-multiple-data (SPMD) code with message passing and/or run-time communication primitives.

This work was supported by the Ministry of Education and Science (CICYT) of Spain under project TIC96-1125-C03-01 and by the Human Capital and Mobility program of the European Union (ERB4050P1921660)

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. B. Chapman, P. Mehrotra et al. (1992) Vienna fortran - a fortran language extension for distributed memory multiprocessors, in J. Saltz and P. Mehrotra (eds.), Languages, Compilers, and Run-Time Environments for Distributed Memory Machines, North-Holland, The Netherlands.

    Google Scholar 

  2. G. Fox, S. Hiranandarii et al. (1990) Fortran D language specification, technical report, Dept. of Computer Science, Rice University.

    Google Scholar 

  3. R. Mirchandaney, J. Saltz et al. (1988) Principles of run-time support for parallel processors, in Proceedings of the 1988 ACM International Conference on Supercomputing, 140–152. ACM, ACM Press.

    Google Scholar 

  4. Alok Choudhary Ravi Ponnusamy, Joel Saltz et al. (1992) Design and specification of PARTI runtime data mapping primitives, technical report, Institute for Advanced Computer Studies, Computer Science Department, University of Maryland, MD. and Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY.

    Google Scholar 

  5. Joel Saltz et alt. (1993) A Manual for the CHAOS Runtime Library,Computer Science Department, University of Maryland, Maryland.

    Google Scholar 

  6. Joel Saltz and Raja Das (1992) A Manual for the PARTI Runtime Primitives. Revision 2, Institute for Advanced Computer Studies, Computer Science Department, University of Maryland, Maryland.

    Google Scholar 

  7. Y.F. Hu, and R.J. Blake (1994) Numerical experiences with partitioning of unstructured meshes, Parallel Computing 20 815–829.

    Article  MATH  Google Scholar 

  8. M. J. Berger and S. H. Bokhari (1987) A partitioning strategy for non-uniform problems on multiprocessors, IEEE Transactions on Computers 36 570–580.

    Article  Google Scholar 

  9. S.H. Bokhari, T.W. Crockettet al. (1993) Parametric binary dissection, technical report 93–39, NASA Langley Research Center.

    Google Scholar 

  10. R. Asenjo, L. F. Romero et al. (1994) Sparse block and cyclic data distributions for matrix computations, in J. Dongarra, Grandinetti et al. (eds), Advanced Workshop on High Performance Computing: Technology Methods and Applications, Elsevier Science, Amsterdam, 359–377.

    Google Scholar 

  11. L. F. Romero and E. L. Zapata (1995) Data distributions for sparse matrix vector multiplication, J. Parallel Computing 21 583–605.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. Ujaldó, E. L. Zapata et al. (1994) Data distributions for sparse matrix problems and their implementarion into VFCS, submitted to IEEE Transactions on Parallel and Distributed Systems.

    Google Scholar 

  13. M. Ujaldon and E. L. Zapata (1995) New data-parallel language features for sparse matrix computations, in Proceedings of the Workshop on Solving Irregular Problems on Distributed Memory Machines, IEEE Computer Society.

    Google Scholar 

  14. T. MacDonald et al. D.M. Pase (1994) The craft fortran programming model, Scientific Programming 3, 227–252.

    Google Scholar 

  15. A. Knies R. Barriuso (1994) SHMEM User’s Guide for C (Revision 2.2),Cray Research Inc.

    Google Scholar 

  16. A. Knies R. Barriuso (1994) SHMEM User’s Guide for Fortran (Revision 2.2),Cray Research Inc.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Bandera, G., Trabado, G.P., Zapata, E.L. (1997). Extending Data-Parallel Languages for Irregularly Structured Applications. In: Grandinetti, L., Kowalik, J., Vajtersic, M. (eds) Advances in High Performance Computing. NATO ASI Series, vol 30. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5514-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5514-4_14

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6322-7

  • Online ISBN: 978-94-011-5514-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics