[QST] Permutation layout for contiguous stores
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 10.5k
- Forks
- 2.1k
- Avg merge
- 3d 11h
- Merged PRs (30d)
- 7
Description
I wrote out this permutation for a TN TF32 16x8x8. I was trying to get the threads to be contiguous when writing N major. I have the following TiledMMA with a cta size of (128,128,32):
TiledMMA mma =
make_tiled_mma(
SM80_16x8x8_F32TF32TF32F32_TN{},
Layout<
Shape<_4,_1>,
Stride<_1,_4>
>{}
,
Tile<
Layout<
Shape<_16>,
Stride<_1>
>,
Layout<
Shape<_2,_16>,
Stride<_1,_8>
>,
_8
>{}
);
Besides working out the swizzle for B (I can see visually what it should do), am I interpreting this diagram correctly that with the right warp shfl_sync I should be able to write 128B contiguous as 16B per thread stores (again, in N major)? Am I paying anything in a non-obvious way with this permutation that I might be missing?
Edit: For example, does this break any of the cp.async or ldmatrix assumptions?
Thanks!
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the TiledMMA layout and permutation shown in the issue, then trace how it interacts with warp shfl_sync, cp.async, and ldmatrix. Done means establishing whether the proposed N-major stores are valid, identifying any costs or broken assumptions, and documenting the required B swizzle.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- hpc, performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100