357cab525b
DPPolicy no longer carries a cross-SIP axis. SIP-level placement is solely controlled by torch.ahbm.set_device(rank) (ADR-0024); DPPolicy itself describes only the cube × PE layout within one SIP. ShardSpec switches to structural (sip, cube, pe) coordinates; the flat pe_index field/property is fully removed — silent drift between global-flat and SIP-local interpretations was a foot-gun flagged by ADR-0024 D11. Breaking API (explicit TypeError / AttributeError): - DPPolicy(sip=...) / DPPolicy(num_sips=...) -> TypeError - ShardSpec.pe_index -> AttributeError - ShardSpec(pe_index=...) -> TypeError - resolve_dp_policy now takes target_sip= (required), no num_sips. Downstream migration: - PE allocator dict keyed by (sip, cube, pe) tuples, in both _ensure_allocators and _free_tensor. deploy_tensor uses tuple lookup. - _create_tensor passes target_sip=current_sip; post-hoc pe_index shifting removed entirely. - launch._compute_local_shape drops the dp.sip branch. - Internal resolvers (column_wise / row_wise / replicate / tiled_*) return _LocalPeShard (cube-local identifier) instead of ShardSpec — resolve_dp_policy lifts them to full structural coords. Tests: - New tests/test_adr0026_dppolicy_intra_device.py (12 tests) pins the contract end-to-end. - test_sip_parallel.py rewritten: SIP composition now modeled as two resolve_dp_policy(target_sip=...) calls (ADR-0024 launcher style). - Call-site migration: test_tensor, test_va_integration, test_va_offset, test_runtime_api_tensor, test_tl_recv_async, test_ccl_* and benches gemm_single_pe, gpt3_qkv, va_offset_verify, ccl_allreduce (legacy branch) all use intra-device DPPolicy and structural ShardSpec. Result: 523 passed, 1 strict xfail (ring_default_ws — unchanged ADR-0024 Phase B blocker; architectural fix deferred to ADR-0027). Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
82 lines
2.8 KiB
Python
82 lines
2.8 KiB
Python
"""Validate the hello-world example from docs/ccl-author-guide.md.
|
|
|
|
This is the simplest possible CCL kernel — each PE sends its tile E
|
|
and receives a tile from W. After running, each rank's slice should
|
|
contain the data of the previous rank.
|
|
"""
|
|
from __future__ import annotations
|
|
|
|
import numpy as np
|
|
|
|
from kernbench.ccl.algorithms import hello_send
|
|
from kernbench.ccl.testing import run_kernel_in_mock
|
|
|
|
|
|
def test_hello_send_4_ranks_mock():
|
|
n_elem = 8
|
|
inputs = [np.full((n_elem,), float(r + 1), dtype=np.float16) for r in range(4)]
|
|
|
|
outputs = run_kernel_in_mock(
|
|
kernel_fn=hello_send.kernel,
|
|
world_size=4,
|
|
topology="ring_1d",
|
|
inputs=inputs,
|
|
kernel_args=(n_elem,),
|
|
)
|
|
|
|
# rank r should have rank (r-1) % 4's data
|
|
for r in range(4):
|
|
prev = inputs[(r - 1) % 4]
|
|
assert np.array_equal(outputs[r], prev), f"rank {r}: got {outputs[r]}"
|
|
|
|
|
|
def test_hello_send_via_simpy_runner():
|
|
"""Same but through real SimPy + IPCQ."""
|
|
from kernbench.policy.placement.dp import DPPolicy
|
|
from kernbench.runtime_api.bench_runner import run_bench
|
|
from kernbench.runtime_api.types import resolve_device
|
|
from kernbench.sim_engine.engine import GraphEngine
|
|
from kernbench.topology.builder import resolve_topology
|
|
|
|
topo = resolve_topology("topology.yaml")
|
|
n_elem = 8
|
|
world_size = 8
|
|
|
|
def run(torch):
|
|
# World size for this hello test is 8 (one cube). ccl.yaml no
|
|
# longer carries a default world_size — pass it explicitly.
|
|
plan = torch.install_ipcq(
|
|
algorithm="ring_allreduce_tcm", world_size_override=world_size,
|
|
)
|
|
a = torch.zeros(
|
|
(1, world_size * n_elem), dtype="f16",
|
|
dp=DPPolicy(
|
|
cube="replicate", pe="column_wise",
|
|
num_cubes=1,
|
|
),
|
|
name="hello_in",
|
|
)
|
|
store = torch.engine.memory_store
|
|
base = a._handle.va_base or a._handle.shards[0].pa
|
|
nbytes = n_elem * 2
|
|
for r in range(world_size):
|
|
store.write("hbm", base + r * nbytes,
|
|
np.full((n_elem,), float(r + 1), dtype=np.float16))
|
|
|
|
torch.launch("hello_send", hello_send.kernel, a, n_elem)
|
|
|
|
# Each rank should hold the previous rank's data after the round
|
|
for r in range(world_size):
|
|
arr = store.read("hbm", base + r * nbytes, shape=(n_elem,), dtype="f16")
|
|
prev_value = float(((r - 1) % world_size) + 1)
|
|
assert np.allclose(arr, prev_value), f"rank {r}: got {arr}, expected {prev_value}"
|
|
|
|
result = run_bench(
|
|
topology=topo, bench_fn=run,
|
|
device=resolve_device("all"),
|
|
engine_factory=lambda t, d: GraphEngine(
|
|
getattr(t, "topology_obj", t), enable_data=True
|
|
),
|
|
)
|
|
assert result.completion.ok
|