Patent
Adaptive routing mechanism for torus interconnection network
Reads0
Chats0
TLDR
In this paper, the authors propose a routing mechanism for non-adaptive virtual channels and non-deterministic virtual paths. But the routing mechanism is not suitable for adaptive virtual channels.Abstract:
A routing mechanism includes two acyclic non-adaptive virtual channels having two types of virtual channel buffers to store packets along deterministic virtual paths between nodes in an n-dimensional networked system, and an adaptive virtual channel having a third type of virtual channel buffer to store the packets along non-deterministic virtual paths between the nodes. The packets are routed between the nodes along either selected portions of the deterministic virtual paths or selected portions of the non-deterministic virtual paths based on routing information such that a packet is never routed on a selected portion of one of the non-deterministic virtual paths unless the third type virtual channel buffer associated with the selected portion of the one non-deterministic virtual path has sufficient space available to store the entire packet.read more
Citations
More filters
Patent
Multiprocessor node controller circuit and method
Martin M. Deneroff,Givargis G. Kaldani,Yuval Koren,David Edward Mccracken,Swaminathan Venkataraman +4 more
TL;DR: In this article, the first node controller is fabricated onto a single integrated-circuit chip and the memory is packaged on plugable memory/directory cards wherein each card includes a plurality of memory chips including a first subset dedicated to holding memory data and a second subset devoted to holding directory data.
Patent
Real time control architecture for admission control in communications network
TL;DR: In this paper, the authors present a method of optimizing the performance of a communications network with respect to admission and control of communications data, which relates to communications network and particularly, although not exclusively, to the method of optimization of a telecommunications network.
Patent
Internet switch router
TL;DR: In this paper, an internet router is implemented as a network fabric of fabric routers and links, where the router receives data packets from trunk lines or other internet links and analyzes header information in the data packets to route the data packet to output internet links.
Patent
Worm-hole run-time reconfigurable processor field programmable gate array (FPGA)
Peter Athanas,Ray Bittner +1 more
TL;DR: The Worm-hole Run-Time Reconfiguration (RTR) as mentioned in this paper is a stream-driven RTR methodology that extends contemporary data-flow paradigms to utilize the dynamic creation of operators and pathways based upon stream processing.
Patent
Hybrid hypercube/torus architecture
TL;DR: A scalable multiprocessor system includes processing element nodes in an n-dimensional topology, and routers for routing messages between the processing element node on the physical communication links as discussed by the authors.
References
More filters
Journal ArticleDOI
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
TL;DR: In this article, a deadlock-free routing algorithm for arbitrary interconnection networks using the concept of virtual channels is presented, where the necessary and sufficient condition for deadlock free routing is the absence of cycles in a channel dependency graph.
Proceedings ArticleDOI
The turn model for adaptive routing
TL;DR: Simulations of partially adaptive and nonadaptive routing algorithms for 2D meshes and hypercubes show that which algorithm has the lowest latencies and highest sustainable throughput depends on the pattern of message traffic.
Journal ArticleDOI
A new theory of deadlock-free adaptive routing in wormhole networks
TL;DR: The theoretical background for the design of deadlock-free adaptive routing algorithms for wormhole networks is developed and some basic definitions and two theorems are proposed, which create the conditions to verify that an adaptive algorithm is deadlocks-free, even when there are cycles in the channel dependency graph.
Journal ArticleDOI
Performance analysis of k-ary n-cube interconnection networks
TL;DR: In this paper, the authors derived expressions for the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks with constant bisection that agree closely with experimental measurements.
Journal ArticleDOI
Virtual-channel flow control
TL;DR: Simulation studies show that, given a fixed amount of buffer storage per link, virtual-channel flow control increases throughput by a factor of 3.5, approaching the capacity of the network.