Tree Topology Computing System for Distributed Training Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large-scale distributed training of deep neural networks faces low computing efficiency due to limited bandwidth between computing nodes, leading to slow aggregation processes and increased training times, which hampers development efficiency and scalability.
Innovation Solution
A tree topology-based computing system is implemented, where node clusters are organized in a multi-layer network structure, allowing for parallel computing and data aggregation between node clusters at the same layer, reducing the amount of data transmitted and improving efficiency through layer-by-layer data aggregation and parallel processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If large-scale distributed training is used to improve computing efficiency, then computing pressure on single server is reduced, but bandwidth between computing nodes is limited causing slow aggregation process
Solution Approach 1:
The patent segments the distributed training system into multiple layers with different functions: parameter servers at the top layer handle aggregation, middle layers perform partial aggregation and forwarding, and bottom layers execute computing tasks. This segmentation allows aggregation operations to be distributed across multiple nodes rather than concentrated on a single node, improving both computing efficiency and aggregation speed by parallelizing the aggregation process across the hierarchical structure.
2Quantity of substance
If more computing nodes are added to increase training scale, then more data can be processed, but data transmission amount increases causing bandwidth bottleneck
Solution Approach 1:
The patent introduces a hierarchical dimension to the distributed training architecture, organizing computing nodes into multiple layers. This dimensional change transforms the flat network structure into a tree-based hierarchy where data transmission occurs through multiple levels. The hierarchical structure reduces bandwidth consumption by enabling partial aggregation at intermediate layers, so that not all nodes need to communicate directly with the top layer, thereby scaling the system to handle larger data volumes without proportionally increasing bandwidth requirements.
3Device complexity
If traditional flat distributed training architecture is used, then implementation is simple, but aggregation process is slow due to limited bandwidth
Solution Approach 1:
The patent implements a nested hierarchical structure where parameter servers are nested at the top layer, middle layers contain aggregation and forwarding nodes, and bottom layers contain computing nodes. Each layer is nested within the broader system structure, with data flowing through nested levels. This nesting approach improves aggregation efficiency by allowing intermediate layers to perform partial aggregation before data reaches the top layer, reducing the total data transmission volume while maintaining a manageable network structure through modular layering.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A tree topology based computing system (10) and method are disclosed. The system may include: a plurality of node clusters, where the plurality of node clusters constitute a multi-layer network structure in a tree topology manner, any minimum tree in the network structure includes a second node cluster serving as a parent node and at least one first node cluster serving as a child node. The first node cluster is configured to: obtain a first computing result based on a first computing input, and send the first computing result to the second node cluster; and the second node cluster is configured to: receive, through a physical link, at least one first computing result sent by the at least one first node cluster, and aggregate the at least one first computing result and a second computing result to obtain a third computing result, where the second computing result is a result obtained by the second node cluster based on a second computing input. According to the system and method, scalability of a distributed computing system can be implemented, and computing efficiency can be improved.