Nothing Special   »   [go: up one dir, main page]

Skip to main content

Abstract

The HPF language provides the user with means to specify complex data parallel Fortran 90 (F90) applications to be executed on distributed memory parallel computers. HPF offers several data distribution modes including BLOCK, BLOCK(M), CYCLIC and CYCLIC(M) combined with alignment features and provides a wide range of data parallel constructs: HPF FORALL and DO INDEPENDENT loops, F90 array assignments and WHERE statements, and F77 DO loop-nests that are proved to show no loop-carried data dependencies. Since the HPF language is gaining acceptance, handling all these features efficiently by HPF compilers is a challenging problem of growing importance.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. M. Alt, U. Aßmann, and H. van Someren, “Cosy Compiler Phase embedding with the CoSy Compiler Model, 5th Int. Conf. CC’94, Edinburgh, LNCS, Vol. 786, April 1994, 278–293.

    Google Scholar 

  2. H. Berryman, J. Saltz and J. Scroggs, “Execution time support for adaptative scientific algorithms on distributed memory machines, Concurrency: Practise and Experience, June 1991,3(3):159–178.

    Article  Google Scholar 

  3. P. Brezany, B. Chapman, R. Ponnusamy, V. Sipkova, and H Zima, “Study of Application Algorithms with Irregular Distributions, tech. report D1Z-3 of the CEI-PACT Project, University of Vienna, April 1994.

    Google Scholar 

  4. P. Brezany, O. Chéron, K. Sanjari, and E. van Konijnenburg, “Processing Irregular Codes Containing Arrays with Multi-Dimensional Distributions by the PREPARE HPF Compiler, HPCN Europe’95, Milan, Springer-Verlag, 526–531.

    Google Scholar 

  5. C. van Reeuwijk, W. Denissen, H.J. Sips, and E.M. Paalvast, “Implementing HPF distributed arrays on a message-passing parallel computer system, submitted for publication.

    Google Scholar 

  6. A. Veen, and M. de Lange, “Overview of the PREPARE Project, 4th Int. Workshop on Compilers for Parallel Computers, Delft, The Netherlands, Dec. 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

André, F., Brezany, P., Chéron, O., Denissen, W., Pazat, JL., Sanjari, K. (1996). A New Compiler Technology for Handling HPF Data Parallel Constructs. In: Szymanski, B.K., Sinharoy, B. (eds) Languages, Compilers and Run-Time Systems for Scalable Computers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2315-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2315-4_21

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5979-1

  • Online ISBN: 978-1-4615-2315-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics