Skip to content

Variable Grouped Swizzle#2914

Open
int-smart wants to merge 6 commits intoNVIDIA:mainfrom
int-smart:feat/variable_swizzle
Open

Variable Grouped Swizzle#2914
int-smart wants to merge 6 commits intoNVIDIA:mainfrom
int-smart:feat/variable_swizzle

Conversation

@int-smart
Copy link
Copy Markdown
Contributor

@int-smart int-smart commented Apr 22, 2026

Description

Grouped Swizzle with variable shape. Not sure if this is needed but if not can be closed.

Fixes #2451

Type of change

  • Documentation change (change only to the documentation, either a fix or a new content)
  • Bug fix (non-breaking change which fixes an issue)
  • New feature (non-breaking change which adds functionality)
  • Breaking change (fix or feature that would cause existing functionality to not work as expected)
  • Infra/Build change
  • Code refactoring

Changes

Please list the changes introduced in this PR:

  • Change A
  • Change B

Checklist:

  • I have read and followed the contributing guidelines
  • The functionality is complete
  • I have commented my code, particularly in hard-to-understand areas
  • I have made corresponding changes to the documentation
  • My changes generate no new warnings
  • I have added tests that prove my fix is effective or that my feature works
  • New and existing unit tests pass locally with my changes

int-smart and others added 3 commits April 21, 2026 23:54
… update C++ operator interface

Signed-off-by: Abhishek <abhi.dtu11@gmail.com>
Signed-off-by: Abhishek <abhi.dtu11@gmail.com>
@greptile-apps
Copy link
Copy Markdown
Contributor

greptile-apps Bot commented Apr 22, 2026

Greptile Summary

This PR extends swizzle_grouped_scaling_factors to handle grouped tensors with non-uniform (M, K) shapes per tensor. It adds a new persistent-grid CUDA kernel that uses an intra-block warp reduction to compute a total-block count and then dispatches each logical block to its owning tensor via an inline prefix-sum scan, while retaining the existing uniform-shape fast path unchanged. The test helper build_grouped_tensor is also corrected to produce num_tensors + 1 offsets, aligning it with the production-side contract already enforced in transformer_engine.cpp.

Confidence Score: 5/5

Safe to merge — only P2 findings (unchecked sync return value in test, O(num_tensors) kernel scan); no correctness bugs identified.

All findings are P2 (style/performance). The core kernel logic, shared-memory usage, and persistent-grid dispatch are correct. The offsets fix in the test helper resolves a latent mismatch with the production validator.

transformer_engine/common/swizzle/swizzle.cu — variable-shape kernel inner scan loop; tests/cpp/operator/test_swizzle.cu — unchecked cudaDeviceSynchronize return value.

Important Files Changed

Filename Overview
transformer_engine/common/swizzle/swizzle.cu Adds grouped_swizzle_scaling_variable_shape_kernel — a persistent-grid kernel that handles per-tensor variable M/K for grouped MXFP8 swizzle. Core logic is correct but the per-block O(num_tensors) scan is a scalability concern.
tests/cpp/test_common.cu Grows the offsets vector from num_tensors to num_tensors + 1 elements — a correctness fix aligning the test helper with the production-side contract enforced in transformer_engine.cpp.
transformer_engine/pytorch/csrc/extensions/swizzle.cpp Removes the guard that rejected non-uniform first_dims/last_dims, enabling the variable-shape code path. No logic changes beyond unlocking the feature.
tests/cpp/operator/test_swizzle.cu Adds performTestGroupedSwizzleMXFP8Variable covering six shape permutations. Minor: cudaDeviceSynchronize() return value is unchecked.

Flowchart

%%{init: {'theme': 'neutral'}}%%
flowchart TD
    A[swizzle_grouped_scaling_factors] --> B{is_variable_shape?}
    B -- No --> C[Uniform-shape path]
    B -- Yes --> D[Variable-shape path]
    D --> E[Compute common_m / common_k]
    E --> F[Size persistent grid via cudaOccupancy]
    F --> G[grouped_swizzle_scaling_variable_shape_kernel]
    G --> H[Warp 0 computes s_total_blocks via warp reduction]
    H --> I[__syncthreads]
    I --> J[Persistent loop: linear_block_id in 0..total_blocks]
    J --> K[O-n scan to find tensor_id and current_scale_base]
    K --> L{rowwise?}
    L -- Yes --> M[swizzle_row_scaling_kernel_impl]
    L -- No --> N[swizzle_col_scaling_kernel_impl]
Loading

Reviews (3): Last reviewed commit: "Merge branch 'main' into feat/variable_s..." | Re-trigger Greptile

Comment on lines +1891 to +1903
int device_id;
cudaGetDevice(&device_id);
int num_SMs;
cudaDeviceGetAttribute(&num_SMs, cudaDevAttrMultiProcessorCount, device_id);
// Find out how many blocks of this specific kernel can fit on one SM
int max_active_blocks_per_sm;
cudaOccupancyMaxActiveBlocksPerMultiprocessor(
&max_active_blocks_per_sm,
grouped_swizzle_scaling_variable_shape_kernel<SF_TILE_DIM_M, SF_TILE_DIM_K>,
TB_DIM * TB_DIM, // block size
max_slm_size // dynamic shared memory
);
int persistent_blocks = num_SMs * max_active_blocks_per_sm;
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P1 Unchecked CUDA API calls can silently produce zero-block launches

cudaGetDevice, cudaDeviceGetAttribute, and cudaOccupancyMaxActiveBlocksPerMultiprocessor are all called without NVTE_CHECK_CUDA. If any of these fail, max_active_blocks_per_sm is left with an indeterminate (or zero) value, making persistent_blocks = 0. Launching the persistent kernel with 0 blocks is legal in CUDA — it silently does nothing — so the output buffer stays uninitialized with no error raised.

Suggested change
int device_id;
cudaGetDevice(&device_id);
int num_SMs;
cudaDeviceGetAttribute(&num_SMs, cudaDevAttrMultiProcessorCount, device_id);
// Find out how many blocks of this specific kernel can fit on one SM
int max_active_blocks_per_sm;
cudaOccupancyMaxActiveBlocksPerMultiprocessor(
&max_active_blocks_per_sm,
grouped_swizzle_scaling_variable_shape_kernel<SF_TILE_DIM_M, SF_TILE_DIM_K>,
TB_DIM * TB_DIM, // block size
max_slm_size // dynamic shared memory
);
int persistent_blocks = num_SMs * max_active_blocks_per_sm;
int device_id;
NVTE_CHECK_CUDA(cudaGetDevice(&device_id));
int num_SMs;
NVTE_CHECK_CUDA(cudaDeviceGetAttribute(&num_SMs, cudaDevAttrMultiProcessorCount, device_id));
// Find out how many blocks of this specific kernel can fit on one SM
int max_active_blocks_per_sm;
NVTE_CHECK_CUDA(cudaOccupancyMaxActiveBlocksPerMultiprocessor(
&max_active_blocks_per_sm,
grouped_swizzle_scaling_variable_shape_kernel<SF_TILE_DIM_M, SF_TILE_DIM_K>,
TB_DIM * TB_DIM, // block size
max_slm_size // dynamic shared memory
));
NVTE_CHECK(max_active_blocks_per_sm > 0, "Occupancy query returned 0 blocks per SM.");
int persistent_blocks = num_SMs * max_active_blocks_per_sm;

Comment on lines +1720 to +1724
if (!is_variable_shape) {
// Fallback to uniform shape implementation
NVTE_CHECK(input->all_same_shape(), "Grouped swizzle requires uniform tensor shapes.");
NVTE_CHECK(input->all_same_last_dim() && input->all_same_first_dim(),
"Grouped swizzle requires uniform tensor shapes.");
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P2 Dead code: redundant assertions inside !is_variable_shape branch

is_variable_shape is defined as !input->all_same_shape(), so inside if (!is_variable_shape) the two NVTE_CHECK calls are tautologies — they can never fire. They add noise and could mislead future readers into thinking the branch can handle non-uniform shapes. Consider removing them or converting them to a comment.

Suggested change
if (!is_variable_shape) {
// Fallback to uniform shape implementation
NVTE_CHECK(input->all_same_shape(), "Grouped swizzle requires uniform tensor shapes.");
NVTE_CHECK(input->all_same_last_dim() && input->all_same_first_dim(),
"Grouped swizzle requires uniform tensor shapes.");
if (!is_variable_shape) {
// All tensors share the same shape; use the optimised uniform-shape path.

if (int_stride % 2 != 0) int_stride++;
int* d_block_offsets = reinterpret_cast<int*>(workspace);
int* d_global_counter = d_block_offsets + num_tensors + 1;
int* d_total_blocks = d_global_counter + 1;
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P2 d_total_blocks is written but never consumed

d_total_blocks is populated by compute_grouped_swizzle_setup (as *total_blocks = current_block_offset) but is never read by the persistent kernel or any host code afterward. The persistent grid terminates via the tensor_id == -1 sentinel, not via a stored total. If this field was intended as a diagnostic or future guard, a comment would clarify its purpose; otherwise it can be removed to avoid confusing future maintainers and wasting a device-side write.

Comment on lines +402 to +412
size_t num_tensors = input.num_tensors();
size_t num_int_elems = num_tensors + 3; // n+1 block_offsets + gc + tb
if (num_int_elems % 2 != 0) num_int_elems++; // pad to even for size_t alignment
size_t workspace_size = num_int_elems * sizeof(int) + (num_tensors + 1) * sizeof(size_t);
workspace_size = roundup(workspace_size, 256);
auto workspace =
allocateSpace(std::vector<size_t>{workspace_size}, transformer_engine::DType::kByte, false);

NVTE_SCOPED_GIL_RELEASE({
nvte_swizzle_grouped_scaling_factors(swizzle_input.data(), swizzle_output.data(),
at::cuda::getCurrentCUDAStream());
getDataPtr(workspace), at::cuda::getCurrentCUDAStream());
Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

P2 Workspace allocated unconditionally even for uniform-shape inputs

The workspace is only consumed by the variable-shape code path in swizzle_grouped_scaling_factors. For uniform shapes the pointer is accepted but immediately ignored. Gating the allocation on whether variable shapes are present (e.g., first_dims.data_ptr != nullptr || last_dims.data_ptr != nullptr) would avoid a small but unnecessary device allocation on every invocation with uniform tensors. This is a performance suggestion, not a correctness issue.

Note: If this suggestion doesn't match your team's coding style, reply to this and let me know. I'll remember it for next time!

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Agreed

@vthumbe1503 vthumbe1503 self-requested a review April 22, 2026 22:33
cudaFuncAttributeMaxDynamicSharedMemorySize, max_slm_size));

int device_id;
cudaGetDevice(&device_id);
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Caching the attrbues like number of sms and max active blocks per device would be ideal to reduce CPU overheads on each call.

We already have a function in transformer_engine/common/util/cuda_runtime.cpp called "sm_count". Could you please use that here?

// Fallback to uniform shape implementation
NVTE_CHECK(input->all_same_shape(), "Grouped swizzle requires uniform tensor shapes.");
NVTE_CHECK(input->all_same_last_dim() && input->all_same_first_dim(),
"Grouped swizzle requires uniform tensor shapes.");
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

These checks might not be needed. Given we used input->all_same_shape() to reach this stage

Copy link
Copy Markdown
Collaborator

@vthumbe1503 vthumbe1503 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think that workspace allocation + small kernel for computing offsets + persistent kernel might be an overkill for swizzling. @int-smart Do you have some performance numbers by any chance for the swizzling kernel on Blackwell?

How about we follow a SM filling grid pattern like in grouped_bias_add kernel in this PR?
https://github.com/NVIDIA/TransformerEngine/pull/2885/changes/BASE..b64559af9b89d816b8d7ffba4f5273e556d90c8e#diff-fa75cbeb11caf588f79b811be355c8f00b0cf5d4b807c259b94f2a40ffc8db6f

With this pattern thread block id is dynamically decided based on sum(first_dims) and at the same time we divide the rows of grouped_tensor uniformly among the SMs. However it only handles variable first_dims(Need to extend the idea for other cases like all dims being variable)

@vthumbe1503 vthumbe1503 self-assigned this Apr 22, 2026
@int-smart
Copy link
Copy Markdown
Contributor Author

@vthumbe1503 Will check the PR and get back

@int-smart
Copy link
Copy Markdown
Contributor Author

int-smart commented Apr 22, 2026

With regards to Blackwell I dont have the numbers tbh. I can generate it for RTX 40 series

int-smart and others added 2 commits April 25, 2026 15:55
@int-smart
Copy link
Copy Markdown
Contributor Author

int-smart commented Apr 25, 2026

@vthumbe1503 Consolidated to one kernel, removed shared memory allocation and tried to stick to the PR you mentioned. If this works let me know. Seems to perform better on rtx 4070 than my last approach. There are still some optimizations can be done but that would need more shared memory alloc.

int num_SMs;
cudaDeviceGetAttribute(&num_SMs, cudaDevAttrMultiProcessorCount, device_id);
int max_active_blocks_per_sm;
cudaOccupancyMaxActiveBlocksPerMultiprocessor(
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Can we add NVTE_CHECK_CUDA around these APIs.

@vthumbe1503
Copy link
Copy Markdown
Collaborator

Thanks for the PR @int-smart. Overall LGTM. Have a few minor comments w.r.t CPU overheads and error handling.

@vthumbe1503
Copy link
Copy Markdown
Collaborator

/te-ci

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Grouped swizzle kernel

2 participants