Shared memory can serve a warp’s accesses at once when its threads use different banks. A bank conflict occurs when threads in the same warp access different addresses in the same bank; those accesses must be serialized. section 11.7
In the 32-bank model for 4-byte elements, an element maps to its index modulo 32. Consecutive accesses land in different banks, but stride-2 accesses use only 16 banks and take two rounds. If all 32 threads access different elements in one bank, service takes 32 rounds. A warp reading the same address is a broadcast, not a conflict. section 11.7 section 11.14
A common symptom is a correct kernel running unexpectedly slowly, with a profiler showing shared-memory accesses serialized. For a 32×32 tile read column-wise, the warp’s threads all hit the same bank. Padding each row to 33 elements shifts successive rows across banks and removes this 32-way conflict for 4-byte elements. Recalculate the mapping for other element sizes or index patterns. section 11.11 section 11.14
__shared__ float tile[32][33]; #A value = tile[threadIdx.x][0]; #B
Compare the padded tile and column access with the 32×32 version to see the conflict fix. section 11.11
The same strided-access issue can arise in Blelloch scan; padding is a possible remedy, while production libraries such as CUB handle it automatically. section 7.11

