Skip to main content
Springer Nature Link
Log in

Connection structures — a component of parallel programming languages

  • Conference paper
Architektur und Betrieb von Rechensystemen

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 168))

  • 46 Accesses

Abstract

Programming languages aiming at execution on highly parallel computer systems should provide means to define virtual interconnection patterns that can be employed as predetermined communication paths between processes. A formalism aiming at this purpose is presented. The use of regular interconnection patterns is encouraged through an algebraic setting of the basic concepts.

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

Access this chapter

Log in via an institution

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

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. G. R. Andrews, F. B. Schneider, Concepts and notations for concurrent programming, ACM Computing Surveys, 15,1, 1983, 3–43

    Article  MATH  Google Scholar 

  2. F. Berman, Edge grammars and parallel computation, Proc. of the 1983 Allerton Conf., Urbana, 214–223

    Google Scholar 

  3. F. Berman, L. Snyder, On mapping parallel algorithms into parallel architectures, Proc. 1984 Conf. on Parallel Processing, 307–309

    Google Scholar 

  4. H. L. Bodlaender, J. van Leeuwen, Simulation of large networks on smaller networks, Inf. and Control 71, 1986, 143–180

    Article  MATH  Google Scholar 

  5. S. H. Bokhari, On the mapping problem, IEEE Transactions on Computers C-30, 1981, 207–211

    Article  MathSciNet  Google Scholar 

  6. P. Brinch Hansen, The programming language Concurrent Pascal, IEEE Transactions on Software Engineering 1(2), 1975, 199–207

    Google Scholar 

  7. J. P. Fishburn, R. A. Finkel, Quotient networks, IEEE Transactions on Computers C-31, 1982, 288–295

    Article  Google Scholar 

  8. Z. Galil, W. Paul, Effizienz paralleler Rechner, Informatik-Fachberichte 33, 1980, 54–64

    Article  MathSciNet  Google Scholar 

  9. C. A. R. Hoare, Monitors: An operating system structuring concept, Comm. ACM 17,10, 1974, 549–557

    Article  MATH  Google Scholar 

  10. C. A. R. Hoare, Communicating sequential processes, Comm. ACM 21,8, 1978, 666–677

    Article  MATH  MathSciNet  Google Scholar 

  11. E. Hotzel, Eine Sprachkomponente für die Programmierung enggekoppelter Mehrrechnersysteme, Arbeitspapiere der GMD 148, 1985

    Google Scholar 

  12. INMOS Corporation, OCCAM Programming Manual, Colorado Springs, 1983

    Google Scholar 

  13. O. Kolp, H. Mierendorff, Systemunabhängige Organisation von Mehrgitterverfahren auf Parallelrechnern, Informatik-Fachberichte 88, 1984, 238–252

    Google Scholar 

  14. M. R. Kramer, D. van Leeuwen, Systolische Berechnungen und VLSI, Informatik-Spektrum 7,3, 1984, 154–165

    Google Scholar 

  15. S.-Y. Kung, K. S. Arun, R.D. Gal-Ezer, D.V. Bhaskar Rao, Wavefront array processor: Language, architecture, and applications, IEEE Transactions on Computers C-31,11, 1982, 1054–1066

    Article  Google Scholar 

  16. A. D. Martin, The TQRUS: An exercise in constructing a processing surface, Proc. of the Caltech Conference on VLSI, 1981

    Google Scholar 

  17. H. Mierendorff, Lastverteilung in eng gekoppelten Mehrrechnersystemen mit beschränkter Nachbarschaft, Informatik-Fachberichte 78, 1984, 37–50

    Article  Google Scholar 

  18. H. Mierendorff, Ein Konzept zur Nutzung eng gekoppelter Mehrrechnersysteme, PARS-Mitteilungen Nr. 2, 1984, 116–123

    Google Scholar 

  19. H. Mühlenbein, M. Gorges-Schleuter, O.-Krämer, New solutions to the mapping problem of parallel systems: The evolution approach, Parallel Computing 4, 1987, 269–279

    Article  Google Scholar 

  20. F. P. Preparata, D. Vuillemin, The Cube-Connected Cycles: A versatile network for parallel computation, Comm. ACM 24, 1981, 300–309

    Article  MathSciNet  Google Scholar 

  21. P. F. Reynolds, Jr., Parallel Processing Structures: Languages, Schedules, and Performance Results, Dissertation University of Texas at Austin, 1979, University Microfilms Int., Ann Arbor, Michigan, 1984, 159 S.

    Google Scholar 

  22. C. H. Sequin, Doubly twisted torus networks for VLSI processor arrays, SIGARCH Newsletter 9,3, 1981, 471–480

    Google Scholar 

  23. E. Shapiro, Systolic programming: A paradigm of parallel processing, Weizmann Institute Technical Report CS84-21, 1984

    Google Scholar 

  24. P. D. Stotts, Jr., A comparative survey of concurrent programming languages, SIGPLAN Notices 1982, 50–61

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Schloβ Birlinghoven, Gesellschaft für Mathematik und Datenverarbeitung mbH, D-5205, Sankt Augustin 1, F. R. Germany

    E. Hotzel

Authors
  1. E. Hotzel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematik-Informatik (FB 17), Universität-Gesamthochschule Paderborn, Warburger Straße 100, 4790, Paderborn, Deutschland

    U. Kastens  & F. J. Rammig  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hotzel, E. (1988). Connection structures — a component of parallel programming languages. In: Kastens, U., Rammig, F.J. (eds) Architektur und Betrieb von Rechensystemen. Informatik-Fachberichte, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73451-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-73451-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18994-7

  • Online ISBN: 978-3-642-73451-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics