Skip to main content

A High-Level Programming Environment for Distributed Memory Architectures

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1999)

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

Included in the following conference series:

  • 341 Accesses

Abstract

The programming of distributed memory architectures can be significantly facilitated by abstract, application-oriented models. The Promoter model reconciles generality and easiness of use by a new con- cept of high-level data parallelism that leads to distributed types with parallel operations. The model enables the user to describe the spatial structures for a wide spectrum of numerical and non-numerical applica- tion in a uniform algebraic formalism, so that the compiler can readily generate the optimized message-passing program.

This work was funded by the Real World Computing (RWC) Partnership, Tsukuba, Japan

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. Li K.: Shared Virtual Memory on Loosely Coupled Multiprocessors, Ph. D. thesis, Yale University 1986

    Google Scholar 

  2. Lenoski D. et al.: The Stanford DASH Multiprocessor, COMPUTER (March 1992)

    Google Scholar 

  3. Giloi W. K., Schramm A.: PROMOTER, An Application-Oriented Programming Model for Massive Parallelism, in Giloi W. K., Jaehnichen S., Shriver B. D. (eds.): Programming Models for Massively Parallel Computers, IEEE-CS Press order no. 4900–02 (Sept. 1993)

    Google Scholar 

  4. Giloi, W. K., Kessler, M., Schramm, A.: “PROMOTER: A High Level, Object-Parallel Programming Language, Proc. Internat. Conf. on High Performance Computing, McGraw-Hill Publishing Co., New Delhi, India 1995

    Google Scholar 

  5. Schramm A.: PROMOTER: A Programming Model for Massive Parallelism, PhD. thesis, Tech. University of Berlin 1997

    Google Scholar 

  6. Besch M.: Extracting Application-Specific Knowledge for Mapping Scientific Computations to Parallel and Distributed Systems, Ph. D. thesis, Tech. University of Berlin 1997

    Google Scholar 

  7. Kernighan B. W., Lin S.: An Efficient Heuristic Procedure for Partitioning Graphs, The Bell System Technical Journal, Feb. 1970, 291–307

    Google Scholar 

  8. Pothen A., Simon H. D., Liou K. P.: Partitioning Sparse Matrices With Eigenvectors of Graphs, SIAM J. Matrix Anal. 11 (1990), 430–452

    Article  MATH  MathSciNet  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

Giloi, W., Pohl, H., Schramm, A. (1999). A High-Level Programming Environment for Distributed Memory Architectures. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics