← Latest papers
🤖 machine learning

HetCCL: Enabling Collective Communication For Mixed-Vendor Heterogeneous Clusters

HetCCL is a novel framework that enables efficient collective communication in mixed-vendor heterogeneous clusters by introducing host-device copy-free P2P transport, a vendor-independent border-communicator mechanism, and a hierarchical topology abstraction, achieving up to 19x higher bandwidth than Gloo and accelerating LLM training by 16.9%.

Original authors: Yuejie Wang, Tao Chang, Yuanyuan Zhao, Yulong Ao, Zeyu Gu, Zhiyu Li, Yanmin Jia, Yan Zhang, Mingjun Zhang, He Liu, Yongzhe He, Yonghua Lin, Guyue Liu

Published 2026-06-01
📖 4 min read☕ Coffee break read

Original authors: Yuejie Wang, Tao Chang, Yuanyuan Zhao, Yulong Ao, Zeyu Gu, Zhiyu Li, Yanmin Jia, Yan Zhang, Mingjun Zhang, He Liu, Yongzhe He, Yonghua Lin, Guyue Liu

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to organize a massive, global relay race to train a super-smart AI (a Large Language Model). In the past, you could only use runners from one specific country (one hardware vendor, like NVIDIA). They all wore the same shoes, spoke the same language, and knew exactly how to pass the baton. This made the race fast and smooth.

But today, running a race with only one country's runners is too expensive or impossible because supplies are low. So, you decide to mix runners from different countries (NVIDIA, AMD, Huawei, etc.). The problem? They speak different languages, wear different shoes, and don't know how to pass the baton to each other without dropping it.

This is the problem HetCCL solves. Here is how it works, broken down into simple concepts:

1. The Problem: The "Host" Bottleneck

In the old mixed-race attempts, if a runner from Country A needed to pass a baton to a runner from Country B, they had to run to a central "Coach" (the CPU) first. The Coach would take the baton, write it down on a clipboard, run it over to the other side, and hand it to the new runner.

  • The Issue: This "Coach" step is slow. It wastes time running back and forth, and the path between the Coach and the runners is a narrow, crowded hallway (the PCIe bottleneck).

2. The Solution: The "Direct Line" (P2P Transport)

HetCCL invents a new way to pass the baton. Instead of using the Coach, it builds a direct, high-speed tunnel between the runners' hands, even if they are from different countries.

  • How it works: HetCCL keeps the "control" (the instructions on when to run) with the Coach, but the "data" (the actual baton) stays on the runners' hands the whole time.
  • The Analogy: Imagine the Coach sends a text message saying, "Go!" The runners then pass the baton directly to each other through a super-fast tunnel, skipping the Coach's office entirely. This eliminates the slow "running back and forth" time.

3. The "Border Guard" Trick (Vendor-Independent Reduction)

Sometimes, the race isn't just about passing a baton; it's about combining information. For example, if Runner A has a number "5" and Runner B has "3," they need to add them up to get "8" before passing the result on.

  • The Problem: Different countries use different math calculators. You can't just ask Runner A to use Runner B's calculator.
  • The Solution: HetCCL creates a "Border Guard" system. It takes the numbers from the different runners, moves them to a specific "Border Station" where a standard, universal calculator (built into the existing software for each country) can do the math. It's like having a universal translator at the border who does the addition for everyone, so no one has to learn a new language.

4. The "Assembly Line" (Hierarchical & Pipelined Design)

In a huge race with many teams, if everyone waits for the previous team to finish before starting, the race is slow.

  • The Solution: HetCCL organizes the race into a hierarchical assembly line.
    • Step 1: Runners within the same country finish their local handoffs first.
    • Step 2: While they are doing that, the "Border Guards" start passing data between countries.
    • Step 3: The final handoffs happen inside the countries again.
  • The Analogy: Instead of waiting for the whole line to stop, the next batch of runners starts moving the moment the previous batch clears the track. This keeps the "tunnels" (network bandwidth) full and busy, rather than sitting idle.

What Did They Prove?

The researchers built this system (called HetCCL) and tested it with real hardware from four different companies. Here is what they found:

  • Speed: In mixed-race scenarios, HetCCL was 17 to 19 times faster than the old "Coach" method (Gloo).
  • Efficiency: It achieved nearly the same speed as if everyone were from the same country, even when mixing different hardware.
  • Real-World Impact: When they used it to train AI models (like Llama 3), the training process finished up to 16.9% faster per step compared to the old methods.

In short: HetCCL is a universal translator and express lane that allows different types of computer chips to work together as a team without slowing each other down, making it cheaper and faster to build massive AI systems.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →