Skip to main content

Efficient and scalable logical busses for message-passing interconnection Networks

  • Interconnection Problems
  • Conference paper
  • First Online:
Distributed Memory Computing (EDMCC 1991)

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

Included in the following conference series:

  • 289 Accesses

Abstract

Distributed-Memory, point-to-point connected MIMD-architectures (multicomputers) realize the communication between their constituent nodes by message-passing interconnection networks. The development of high-speed cut-through-type routing modules for interconnection networks has passed two generations: modules of the first generation offer distributed applications a pseudo-complete interconnection structure; modules of the second generation are enhanced by end-to-end functions which aim at the reduction of the software latency imposed on network nodes. This paper presents a third generation of cut-through routing, a 2-level cut-through routing method, and its utilization for the implementation of efficient, scalable Logical Busses. A Logical Bus represents an abstraction of a global interaction relationship between an arbitrary set of asynchronously operating nodes and allows their convenient coordination.

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 74.99
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.

VI. References

  1. Dally, W. J., Seitz, C. L.: The Torus Routing Chip; Distributed Computing, Vol. 1, Springer-Verlag 1986.

    Google Scholar 

  2. Nugent, S.F.: The iPSC/2 Direct-Communication Technology, ACM Proc. Third Hypercube Conf., 1988.

    Google Scholar 

  3. Upfal, E.: Efficient Schemes for Parallel Communication, JACM, 31(3), 1984.

    Google Scholar 

  4. Schneider, M. F.: Entwicklung eines intelligenten Vermittlungsbausteins für 2WADE-Kommunikation in Polyknoten-Systemen; Fachbereich Informatik der Universität des Saarlandes, Diplomarbeit, 1989.

    Google Scholar 

  5. Malowaniec, K. T.: Das dynamische Leitungsvermittlungsnetz für verteilte Systeme; Fachbereich Informatik der Universität des Saarlandes, Dissertation, April 1990.

    Google Scholar 

  6. Malowaniec, K. T., Scheidig, H., Schneider, M. F., Spurk, R.: Efficient Communication in Polynode Systems; Proc. of the 1st European Workshop on Hypercube and Distributed Computers, 4–6 October 1989, North Holland.

    Google Scholar 

  7. Scheidig, H., Schneider, M.F., Schweizer, M., Spurk, R.: Hardware support for Symbolic-Communication Multicomputers, Technical Report, Dept. of Comp. Sci., University of Saarbrücken, Nov. 1990.

    Google Scholar 

  8. Kermani, P., Kleinrock, L.: Virtual Cut-Through: A New Computer Communication Switching Technique; Computer Networks, 1979.

    Google Scholar 

  9. AT&T: T7110 SPYDER-S User Manual; AT&T 1987.

    Google Scholar 

  10. Scheidig, H., Schneider, M.F., Spurk, R.: An Efficient Organization for Large, Network-Based Multicomputer Systems; Proc. of the 5-th Jerusalem Conf. on Information Technology, Oct. 22–25, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arndt Bode

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scheidig, H., Schneider, M.F., Spurk, R. (1991). Efficient and scalable logical busses for message-passing interconnection Networks. In: Bode, A. (eds) Distributed Memory Computing. EDMCC 1991. Lecture Notes in Computer Science, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032935

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46478-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics