交换机拓扑感知的通用集合通信算法自动合成方法及装置
By constructing a weighted directed graph as the physical interconnection topology of switches and computing devices, communication operators are built based on the directed graph, a time-extended network is constructed, preconditions and postconditions are generated, resource reservation and dedicated optimization strategies are executed, and an event-driven greedy synthesis framework is designed. This solves the problem of low synthesis efficiency of aggregate communication algorithms under multi-level switch topologies and realizes efficient and adaptive aggregate communication.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- ZHEJIANG UNIV
- Filing Date
- 2026-04-22
- Publication Date
- 2026-07-17
AI Technical Summary
Existing technologies struggle to achieve efficient, universal, and scalable automatic synthesis of aggregated communication algorithms in multi-level switch topologies, resulting in low communication efficiency.
By constructing a weighted directed graph of the physical interconnection topology of switches and computing devices, communication operators are built based on the directed graph, a time-extended network is constructed, preconditions and postconditions are generated, resource reservation and dedicated optimization strategies are executed, and an event-driven greedy synthesis framework is designed to achieve accurate modeling and efficient scheduling of multi-level switch topologies.
It significantly improves the bandwidth efficiency of aggregate communication, reduces the time overhead of operator synthesis, solves the tail latency problem of AlltoAll multi-hop communication, simplifies the deployment process of integration into existing communication libraries, and provides an efficient and adaptive aggregate communication solution.
Smart Images
Figure CN122069237B_ABST