2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT) (2012)
Minneapolis, MN, USA
Sept. 19, 2012 to Sept. 23, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/
Christopher W. Fletcher , Massachusetts Institute of Technology; Cambridge, USA
Rachael Harding , Massachusetts Institute of Technology; Cambridge, USA
Omer Khan , University of Connecticut; Storrs, USA
Srinivas Devadas , Massachusetts Institute of Technology; Cambridge, USA
This paper argues for a “less is more” design philosophy when integrating dynamic optimization into a multicore system. The primary insight is that dynamic optimization is inherently loosely-coupled and can therefore be supported on multicores with very low-overhead by using a Partner core. We exploit this property by designing a dynamic optimizer composed of a two-core partnership that requires a minimal amount of dedicated hardware and is resilient to (a) reducing the Partner core's clock frequency, (b) changing the Partner core's placement on the multicore die and (c) varying the latency of dynamic optimization operations.
Optimization, Multicore processing, Instruction sets, Hardware, Message systems, Benchmark testing
C. W. Fletcher, R. Harding, O. Khan and S. Devadas, "A low-overhead dynamic optimization framework for multicores," 2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT), Minneapolis, MN, USA, 2012, pp. 467-468.