On-Chip Packet-Switched Ring Network with Virtual Channels
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional packet-switched networks face scalability limitations and deadlock issues, leading to inefficiencies in resource utilization and data loss, particularly when the number of nodes exceeds eight.
Innovation Solution
A scalable on-chip packet-switched communication network is designed with a unique ring structure incorporating N routers and N pairs of opposite uni-directional ring links, each carrying two virtual channels, along with distributed processing to determine path directions and virtual channel usage, preventing deadlocks by ensuring at least one transition between routers or diametrically opposite routers followed by a circular path.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional packet-switched networks are used, then resources are not reserved and packets can access communication links on demand, but scalability is limited and deadlock problems occur
Solution Approach 1:
The patent segments the communication network into multiple rings, each containing a specific number of nodes (power of 2). This segmentation allows the system to scale by adding more rings rather than expanding a single large ring, thereby maintaining deadlock-free operation while improving scalability and resource utilization efficiency.
2Quantity of substance
If the number of nodes is increased beyond eight, then network capacity is improved, but scalability limitations and performance degradation occur
Solution Approach 1:
The network is divided into multiple rings, each with a manageable number of nodes (power of 2). This segmentation approach allows the system to scale to large numbers of nodes while keeping each individual ring simple and manageable, thus avoiding the complexity issues that would arise from a single large ring structure.
Solution Approach 2:
The patent introduces a hierarchical dimension by organizing rings within rings. Smaller rings can be nested within larger rings, creating a multi-dimensional network structure that scales efficiently. This dimensional approach allows the system to handle large numbers of nodes without proportionally increasing the complexity of individual network elements.
3Device complexity
If a unique ring structure is used regardless of N, then network simplicity is maintained, but deadlock avoidance becomes difficult when N is large
Solution Approach 1:
The patent segments the large ring into multiple smaller rings, each with a power-of-2 number of nodes. This segmentation maintains the simplicity of individual rings while making deadlock avoidance more manageable through distributed control. Each smaller ring can independently manage its routing, reducing the complexity of deadlock prevention compared to a single large ring.
Solution Approach 2:
The patent introduces a hierarchical dimension where rings are nested within rings. This multi-dimensional structure allows for simplified deadlock avoidance by confining routing decisions to smaller, manageable rings while maintaining the overall network topology. The hierarchical organization provides multiple levels of control that make deadlock prevention more effective.
4Productivity
If virtual channels are added to ring links, then bandwidth and routing flexibility are improved, but resource management complexity increases
Solution Approach 1:
The patent segments the virtual channel management into discrete, manageable units within each ring. By organizing virtual channels in relation to the segmented ring structure, the system can manage multiple virtual channels without overwhelming complexity. Each ring can independently manage its virtual channels, distributing the management burden across the network.
Solution Approach 2:
The patent introduces a hierarchical dimension to virtual channel management by nesting virtual channels within the ring hierarchy. This allows for efficient resource management where virtual channels are allocated and managed at different levels of the hierarchy, improving bandwidth utilization while keeping management complexity controlled through the structured organization.
Data Source
AI summary
A system for routing a data packet between N elements includes N network interfaces respectively connected to the N elements, with N being an even integer, and an on-chip packet-switched communication network arranged in a ring structure. The packet-switched communication network includes N routers respectively connected to the N interfaces, and N pairs of opposite uni-directional ring links. Each pair of ring links couples two adjacent routers in the ring structure, and each ring link provides two virtual channels. There are N/2 pairs of opposite uni-directional crossing links, with each pair of crossing links coupling two diametrically opposite routers in the ring structure. Processing circuitry is distributed within the N routers and the N network interfaces for determining direction of the data packet to be transmitted over a path from a source element to a destination element in the ring structure, and for determining at each router in the path which virtual channel is to be used to avoid deadlocks in the transmission.