179 questions
No questions match those filters.
Training sequence length is 128K and the KV cache no lo...
This is one of the questions in the full AI/ML interview bank. Pro unlocks all 1789 questions; Premium includes the same bank plus the highest daily Practice limit.
See plansPlain sequence parallelism shards the query dimension across GPUs but leaves the key/value dimension whole on every device, so it doesn’t actually relieve KV memory pressure — every GPU still needs every key and value to run local attention, which is exactly the memory that scales quadratically with sequence length and is breaking at long context.
Ring attention shards both dimensions: each GPU keeps only its local shard of K and V, and shards rotate around a ring of GPUs step by step, with each device accumulating attention output against whichever chunk currently sits in its buffer and freeing it once used. That turns what would otherwise be quadratic memory (or a quadratic burst if you naively all-gather the full KV before running local attention) into a linear communication cost per device that doesn’t grow with how finely you shard — you’re rotating fixed-size chunks around a ring instead of gathering the whole sequence anywhere, and with enough compute per tile the ring transfers overlap with attention math and add negligible wall-clock overhead. In practice this only earns its complexity past roughly 32K tokens; below that, FlashAttention inside an existing tensor-parallel group already keeps KV memory manageable, so context parallelism is a long-context-specific tool, not a default axis you add everywhere.