Improving CC-NUMA performance using instruction-based prediction

We propose Instruction-based Prediction as a means to optimize directory-based cache coherent NUMA shared-memory Instruction-based prediction is based on observing die behavior of load and store instructions in relation to coherent events and predicting their future behavior Although this technique is,well established in the uniprocessor world, it has not been widely applied for optimizing transparent shared-memory: Typically in this environment, prediction is based on data-block access history (address-based prediction) in the form of adaptive cache coherence protocols. The advantage of instruction-based prediction is that it requires few hardware resources in the form of small prediction structures per node to match (or exceed) the performance of address-based prediction. To show rite potential of instruction-based prediction we propose aid evaluate three different optimizations: i) a migratory sharing optimization, ii) a wide sharing optimization, and iii) a producer-consumer optimization based on speculative execution. With execution-driven simulation and a set of nine benchmarks,we show that ii for the first two optimizations, instruction-based prediction, using few predictor entries per node, outpaces address-based schemes, and (iii for the producer-consumer optimization which rises speculative execution, low mis-speculation rates show promise for performance improvements.