TA的每日心情 | 开心
2020-4-8 10:45 |
|---|
签到天数: 227 天 [LV.7]分神
|
% W( S: ^1 b! j7 Y2 O; k2 v* k9 I
在论文里，这是第3.2.2节的内容
% o, S: v4 z) Q2 V# f" H7 x2 |. x9 F& E0 q# i7 k( u$ h
3.2.2. Efficient Implementation of Cross-Node All-to-All Communication7 O6 u) o* k+ K
In order to ensure sufficient computational performance for DualPipe, we customize efficient
0 f C7 A" N9 p* Wcross-node all-to-all communication kernels (including dispatching and combining) to conserve
# o- m4 x! ~+ l1 n) wthe number of SMs dedicated to communication. The implementation of the kernels is codesigned with the MoE gating algorithm and the network topology of our cluster. To be specific,
: M E. R3 y) X+ b. ^; V& win our cluster, cross-node GPUs are fully interconnected with IB, and intra-node communications3 j* F8 U5 n; [0 j! B3 w
are handled via NVLink. NVLink offers a bandwidth of 160 GB/s, roughly 3.2 times that of IB; y& V) f C) v
(50 GB/s). To effectively leverage the different bandwidths of IB and NVLink, we limit each m4 f4 D; Z, u5 D4 `1 K
token to be dispatched to at most 4 nodes, thereby reducing IB traffic. For each token, when its
& Y9 B, R! i8 _routing decision is made, it will first be transmitted via IB to the GPUs with the same in-node0 a- I: T' Q' c6 M- s F& ]- r8 H
index on its target nodes. Once it reaches the target nodes, we will endeavor to ensure that it is# z) f5 I2 H0 }) S" {. W" B
instantaneously forwarded via NVLink to specific GPUs that host their target experts, without
+ X* f, d, Z, J$ C# R$ ?; Z! D% wbeing blocked by subsequently arriving tokens. In this way, communications via IB and NVLink; z% P4 M5 ^5 |$ _/ q
are fully overlapped, and each token can efficiently select an average of 3.2 experts per node- s* j( ~/ j: R) }
without incurring additional overhead from NVLink. This implies that, although DeepSeek-V3
* i7 R2 Y; Z! k+ k3 u K- S13
/ e+ V5 C) Z; uselects only 8 routed experts in practice, it can scale up this number to a maximum of 13 experts
$ B+ \# Y% ]0 `: x! I! w" G: s1 `(4 nodes × 3.2 experts/node) while preserving the same communication cost. Overall, under5 ] y- a3 ]0 w. L9 u9 z0 m, t9 h
such a communication strategy, only 20 SMs are sufficient to fully utilize the bandwidths of IB
" D" y1 @8 M: q8 s& d2 O" eand NVLink.
. Z/ c i# A% LIn detail, we employ the warp specialization technique (Bauer et al., 2014) and partition R/ T4 ^9 y e. j+ k f+ \9 y
20 SMs into 10 communication channels. During the dispatching process, (1) IB sending, (2)! p) H1 R9 o+ x! m! I2 T
IB-to-NVLink forwarding, and (3) NVLink receiving are handled by respective warps. The* h9 L4 `( Q; S% U3 b g
number of warps allocated to each communication task is dynamically adjusted according to the
4 r4 f) f6 ?" ~! Y0 [) Aactual workload across all SMs. Similarly, during the combining process, (1) NVLink sending,
! ~1 C q# e$ U7 [( v9 T(2) NVLink-to-IB forwarding and accumulation, and (3) IB receiving and accumulation are also
- y# ` n/ |: F$ H8 d/ ] Qhandled by dynamically adjusted warps. In addition, both dispatching and combining kernels
) \, V; \/ y/ e; A7 o8 ~& [8 @& Yoverlap with the computation stream, so we also consider their impact on other SM computation+ U9 W5 Z1 F0 p9 |' V; O e
kernels. Specifically, we employ customized PTX (Parallel Thread Execution) instructions and; B( q; }( ]8 @7 P* f3 \2 y3 M
auto-tune the communication chunk size, which significantly reduces the use of the L2 cache
; P% l2 f4 o( T, R7 K- @3 D' land the interference to other SMs.% g) I- e5 L6 h$ P8 `8 z9 o, Y
. e/ H ~ J; P
通俗一点说，就是为了实现高效的跨节点全面通信。解决的问题本质上和唐家山老师日志里说的双机对拷的场景差不多。一般来说单机多卡之间用nvlink，多机多卡之间依赖IB网络，但nvlink的速率是IB网络的速率的3.2倍，需要通过一些优化来实现更好的传输策略。这是一整套方案。
# W) A: s# V: w& U( p- J( r" \
. j1 Z9 D3 N6 V; c" _我的理解，使用PTX在其中，是为了更精准的定制线程执行减少通信块分配传输之间的串扰。
) l: y' F# q) |2 K, A- X0 h/ J1 H. K7 d% i( H& @4 a
目的不是为了绕cuda，反而是为了让cuda的效率更高。# O. F8 g8 ~, ^ ?- q9 h
& d. K# I" ~) L3 U& t6 ?$ b; e类比一下，就好比发现网卡驱动在对拷特定内存块的时候会和应用的线程执行出现串行导致效率降低，而绕开操作系统定义的与网卡驱动的接口，直接使用网卡支持的指令集进行了优化。 |
评分
-
查看全部评分
|
雷达卡
楼主
收藏
分享
淘帖
支持
反对
提升卡
置顶卡
沉默卡
喧嚣卡
变色卡
抢沙发
千斤顶
显身卡
发表于 2025-2-4 01:15:04