Virtual Channel Scheduling for Deadlock-Free All-to-All Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Deadlocks occur in direct-connect computational networks during all-to-all data transmissions due to cycles in the channel dependency graph, leading to buffer overflow and halted data transmission.
Innovation Solution
Implement techniques to prevent deadlock by creating virtual channels and applying bi-level constraints to ensure a cycle-free network topology, using a controller to manage bandwidth and flow constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If direct connect topology is used for simultaneous data transmission between nodes, then transmission efficiency is improved, but deadlock occurs due to cycles in channel dependency graph
Solution Approach 1:
The patent segments the network channels into multiple virtual channels (VC0, VC1, VC2, VC3) to break the cyclic dependency that causes deadlock. Each virtual channel is assigned specific routing directions (e.g., VC0 for east-west, VC1 for west-east), thereby dividing the channel resource into independent segments that cannot form cycles among themselves.
Solution Approach 2:
The patent introduces virtual channels as intermediaries between physical channels and data transmissions. These virtual channels act as mediators that manage resource allocation and routing decisions, preventing direct cyclic dependencies between nodes while maintaining efficient data flow through controlled access to physical channels.
2Reliability
If virtual channels are introduced to prevent deadlock, then reliability is improved, but device complexity increases
Solution Approach 1:
The patent changes the parameter of channel identification from simple physical channel identifiers to composite identifiers that include virtual channel information. This parameter change enables the system to track and control data flow through virtual channels without requiring complex additional hardware, as the virtual channel information can be embedded in existing packet headers.
Solution Approach 2:
The virtual channel mechanism serves multiple functions simultaneously: it prevents deadlock by breaking cycles, manages bandwidth allocation through demand and conservation constraints, and provides flow control. This multi-functionality reduces the need for separate mechanisms for each function, thereby limiting the increase in overall system complexity.
3Ease of operation
If bandwidth constraints are applied to manage flow, then network control is improved, but transmission speed is reduced
Solution Approach 1:
The patent implements dynamic bandwidth allocation where the available bandwidth for each virtual channel is adjusted based on current network conditions and demand. The bandwidth constraints are not fixed but are dynamically recalculated to allow maximum transmission speed while preventing deadlock, adapting to changing traffic patterns in real-time.
Solution Approach 2:
The system periodically evaluates and updates bandwidth allocations and flow constraints based on current network state. This periodic action allows the system to maintain tight control over network flow to prevent deadlock while maximizing transmission speed during periods when constraints are not active, creating a rhythm of control and free flow.
Data Source
AI summary
This disclosure relates to determining a first bandwidth of one or more first links for one or more nodes in the network; determining a second bandwidth of one or more second links for the one or more nodes; determining that a demand constraint has been met on the network; and determining that a conservation constraint has been met on the network.