TY - GEN
T1 - DynaSpAM
T2 - 42nd Annual International Symposium on Computer Architecture, ISCA 2015
AU - Liu, Feng
AU - Ahn, Heejin
AU - Beard, Stephen R.
AU - Oh, Taewook
AU - August, David I.
N1 - Publisher Copyright:
© 2015 ACM.
PY - 2015/6/13
Y1 - 2015/6/13
N2 - Spatial architectures are more efficient than traditional Out-of-Order (OOO) processors for computationally intensive programs. However, spatial architectures require mapping a program, either statically or dynamically, onto the spatial fabric. Static methods can generate efficient mappings, but they cannot adapt to changing workloads and are not compatible across hardware generations. Current dynamic methods are adaptive and compatible, but do not optimize as well due to their limited use of speculation and small mapping scopes. To overcome the limitations of existing dynamic mapping methods for spatial architectures, while minimizing the inefficiencies inherent in OOO superscalar processors, this paper presents DynaSpAM (Dynamic Spatial Architecture Mapping), a framework that tightly couples a spatial fabric with an OOO pipeline. DynaSpAM coaxes the OOO processor into producing an optimized mapping with a simple modification to the processor's scheduler. The insight behind DynaSpAM is that today's powerful OOO processors do for themselves most of the work necessary to produce a highly optimized mapping for a spatial architecture, including aggressively speculating control and memory dependences, and scheduling instructions using a large window. Evaluation of DynaSpAM shows a geomean speedup of 1.42x for 11 benchmarks from the Rodinia benchmark suite with a geomean 23.9% reduction in energy consumption compared to an 8-issue OOO pipeline.
AB - Spatial architectures are more efficient than traditional Out-of-Order (OOO) processors for computationally intensive programs. However, spatial architectures require mapping a program, either statically or dynamically, onto the spatial fabric. Static methods can generate efficient mappings, but they cannot adapt to changing workloads and are not compatible across hardware generations. Current dynamic methods are adaptive and compatible, but do not optimize as well due to their limited use of speculation and small mapping scopes. To overcome the limitations of existing dynamic mapping methods for spatial architectures, while minimizing the inefficiencies inherent in OOO superscalar processors, this paper presents DynaSpAM (Dynamic Spatial Architecture Mapping), a framework that tightly couples a spatial fabric with an OOO pipeline. DynaSpAM coaxes the OOO processor into producing an optimized mapping with a simple modification to the processor's scheduler. The insight behind DynaSpAM is that today's powerful OOO processors do for themselves most of the work necessary to produce a highly optimized mapping for a spatial architecture, including aggressively speculating control and memory dependences, and scheduling instructions using a large window. Evaluation of DynaSpAM shows a geomean speedup of 1.42x for 11 benchmarks from the Rodinia benchmark suite with a geomean 23.9% reduction in energy consumption compared to an 8-issue OOO pipeline.
UR - http://www.scopus.com/inward/record.url?scp=84960083457&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84960083457&partnerID=8YFLogxK
U2 - 10.1145/2749469.2750414
DO - 10.1145/2749469.2750414
M3 - Conference contribution
AN - SCOPUS:84960083457
T3 - Proceedings - International Symposium on Computer Architecture
SP - 541
EP - 553
BT - ISCA 2015 - 42nd Annual International Symposium on Computer Architecture, Conference Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 13 June 2015 through 17 June 2015
ER -