Conference paper
Constraint graph analysis of multithreaded programs
Harold W. Cain, Mikko H. Lipasti, et al.
Journal of Instruction-Level Parallelism
Value-based replay eliminates the need for content-addressable memories in the load queue, removing one barrier to scalable out-of-order instruction windows. Instead, correct memory ordering is maintained by simply re-executing certain load instructions in program order. A set of novel filtering heuristics reduces the average additional cache bandwidth demanded by value-based replay to less than 3.5 percent.
Harold W. Cain, Mikko H. Lipasti, et al.
Journal of Instruction-Level Parallelism
Peng Wu, Maged M. Michael, et al.
CCPE
Harold W. Cain, Mikko H. Lipasti
SPLASH 2012
Jason Zebchuk, Harold W. Cain, et al.
PACT 2012