• English
  • Deutsch
  • Log In
    Password Login
    Research Outputs
    Fundings & Projects
    Researchers
    Institutes
    Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Konferenzschrift
  4. Minimal routing in reconfigurable communication networks
 
  • Details
  • Full
Options
1996
Conference Paper
Title

Minimal routing in reconfigurable communication networks

Abstract
The data throughput of communication networks of MIMD computers increases if only local communication can be achieved. Hence, adapting the network topology to the application and using a flexible routing algorithm promises improved performance. Different routing algorithms for ATM-networks and MIMD computers have been investigated. In result a topology-independent routing criterion has been found and implemented into a minimal routing algorithm. The routing problem is split into a topology-dependent addressing problem, which needs to be solved once for every topology, and into a topology-independent evaluation of addresses allowing a direct VLSI-implementation. Experiments demonstrate the applicability of the routing algorithm to topologies of varying connectivity and regularity and different buffering styles.
Author(s)
Rosner, S.
Danz, S.
Scholles, M.
Mainwork
Second International Conference on Massively Parallel Computing Systems 1996. Proceedings  
Conference
International Conference on Massively Parallel Computing Systems (MPCS) 1996  
Language
English
IMS2  
Keyword(s)
  • Adressierung

  • Blockierung

  • routing

  • Speicherschema

  • Topologie

  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Contact
© 2024