Vector Runahead for Indirect Memory Accesses

Vector runahead delivers extremely high memory-level parallelism even for the chains of dependent memory accesses with complex intermediate address computation, which conventional techniques fundamentally cannot handle and, therefore, have ignored. It does this by rearchitecting to use speculative data-level parallelism, rather than work skipping, as its primary form extracting more in mode a true execution can, we hope will bring about an entirely new dimension high-performance processors.