article

Opportunity for compute partitioning in pursuit of energy-efficient systems

Authors:

Prasenjit Chakraborty,

Gautam Doshi,

Shashank Shekhar,

Vikrant KumarAuthors Info & Claims

ACM SIGPLAN Notices, Volume 51, Issue 5

Pages 92 - 101

https://doi.org/10.1145/2980930.2907956

Published: 13 June 2016 Publication History

Get Access

Abstract

Performance of computing systems, from handhelds to supercomputers, is increasingly constrained by the energy consumed. A significant and increasing fraction of the energy is consumed in the movement of data. In a compute node, caches have been very effective in reducing data movement by exploiting the available data locality in programs. Program regions with poor data locality, then effect most of the data movement, and consequently consume an ever larger fraction of energy. In this paper we explore the energy efficiency opportunity of minimizing the data movement in precisely such program regions, by first imagining the possibility of compute near memory, and then partitioning the program’s execution between a compute core and the compute near memory (CnM). Due to the emergence of 3D stacked memory, a CnM implementation appears more realistic. Our focus is on evaluating the partitioning opportunity in applications and to do a limit study of systems enabled with CnM capabilities to understand and guide their architectural embodiment. We describe an automated method of analyzing the data access pattern of optimized workload binaries, via a binary-instrumentation tool called SnapCnM, to identify the beneficial program regions (loops) for CnM execution.We also perform a limit study to evaluate the impact of such partitioning over a range of parameters affecting CnM design choices. Our results show that compute partitioning a small (<10%) fraction of a workload can improve its energy efficiency from 3% (for compute-bound applications) to 27% (for memory-bound applications). From the study in this work we discuss the important aspects that help to shape the future CnM design space.

References

[1]

J. Aamer, S. C. Robert, C.-K. Luk, and B. Jacob. CMP$im: A pin-based on-the-fly multi-core cache simulator. In Fourth Annual Workshop on Modeling, Benchmarking and Simulation, MoBS, 2008 B. Akin, J. C. Hoe, and F. Franchetti. Hamlet: Hardware accelerated memory layout transform within 3d-stacked dram. In High Performance Extreme Computing Conference (HPEC). IEEE, Sept 2014.

Google Scholar

[2]

J. Andrews and N. Baker. Xbox 360 system architecture. IEEE Micro, 26 (2):25–37, Mar. 2006. ISSN 0272-1732 K. Beyls and E. H. DHollander. Reuse distance as a metric for cache behavior. In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems, pages 617–662, 2001.

Digital Library

Google Scholar

[3]

B. Black, M. Annavaram, N. Brekelbaum, J. DeVale, L. Jiang, G. H. Loh, D. McCauley, P. Morrow, D. W. Nelson, D. Pantuso, et al. Die stacking (3d) microarchitecture. In Microarchitecture, 2006. MICRO-39. 39th Annual IEEE/ACM International Symposium on, pages 469–479. IEEE, 2006.

Digital Library

Google Scholar

[4]

T. E. Carlson, W. Heirman, and L. Eeckhout. Sniper: Exploring the level of abstraction for scalable and accurate parallel multi-core simulation. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’11, pages 52:1–52:12, New York, NY, USA, 2011. ACM. ISBN 978-1-4503-0771-0 J. Chame, J. Shin, and M. Hall. Code transformations for exploiting bandwidth in pim-based systems, 2000.

Digital Library

Google Scholar

[5]

G. Keramidas, P. Petoumenos, and S. Kaxiras. Cache replacement based on reuse-distance prediction. In Proceedings of the 25th International Conference on Computer Design, ICCD ’07, pages 245–250, Washington, DC, USA, 2007. IEEE Computer Society. ISBN 978-1-4244-1258-7 T. Kgil, S. D’Souza, A. Saidi, N. Binkert, R. Dreslinski, T. Mudge, S. Reinhardt, and K. Flautner. Picoserver: using 3d stacking technology to enable a compact energy efficient chip multiprocessor. ACM SIGARCH Computer Architecture News, 34(5):117–128, 2006.

Crossref

Google Scholar

[6]

M. Kim, C. K. Luk, and H. Kim. Prospector: Discovering parallelism via dynamic data-dependence profiling. Technical report, Georgia Inst. of Technology, 2009.

Google Scholar

[7]

P. Kogge, T. Sunaga, H. Miyataka, K. Kitamura, and E. Retter. Combined dram and logic chip for massively parallel systems. In Proceedings of the 16th Conference on Advanced Research in VLSI, pages 4–16, Washington, USA, 1995. IEEE. ISBN 0-8186-7074-9 P. M. Kogge, S. C. Bass, J. B. Brockman, D. Z. Chen, and E. Sha. Pursuing a petaflop: Point designs for 100 tf computers using pim technologies. In Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation, FRONTIERS ’96, pages 88–, Washington, DC, USA, 1996.

Digital Library

Google Scholar

[8]

IEEE Computer Society. ISBN 0-8186-7551-9 C. E. Kozyrakis, S. Perissakis, D. Patterson, T. Anderson, K. Asanovic, N. Cardwell, R. Fromm, J. Golbus, B. Gribstad, K. Keeton, R. Thomas, N. Treuhaft, and K. Yelick. Scalable processors in the billion-transistor era: Iram. Computer, 30(9):75–78, Sept. 1997. ISSN 0018-9162 J. Lee, D. Solihin, and J. Torrettas. Automatically mapping code on an intelligent memory architecture. In The Seventh International Symposium on High-Performance Computer Architecture, HPCA., pages 121–132. IEEE, 2001.

Digital Library

Google Scholar

[9]

G. H. Loh. 3d-stacked memory architectures for multi-core processors. In ACM SIGARCH computer architecture news, volume 36, pages 453–464. IEEE Computer Society, 2008.

Digital Library

Google Scholar

[10]

S.-M. Yoo, J. Renau, M. Huang, and J. Torrellas. Flexram architecture design parameters. Center for Supercomputing Research and Development (CSRD), Tech. Rep, 1584, 2000.

Google Scholar

[11]

Q. Zhu, T. Graf, H. Sumbul, L. Pillegi, and F. Franchetti. Accelerating sparse matrix-matrix multiplication with 3d-stacked logic-in-memory hardware. In High Performance Extreme Computing Conference (HPEC), pages 1–6. IEEE, Sept 2013

Google Scholar

Cited By

View all

Sun WLi ZYin SWei SLiu LMartínez JDuato JJohn L(2021)ABC-DIMMProceedings of the 48th Annual International Symposium on Computer Architecture10.1109/ISCA52012.2021.00027(237-250)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1109/ISCA52012.2021.00027
Sun WLi ZYin SWei SLiu L(2021)ABC-DIMM: Alleviating the Bottleneck of Communication in DIMM-based Near-Memory Processing with Inter-DIMM Broadcast2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA)10.1109/ISCA52012.2021.00027(237-250)Online publication date: Jun-2021
https://doi.org/10.1109/ISCA52012.2021.00027
Taylor BMarco VWang Z(2017)Adaptive optimization for OpenCL programs on embedded heterogeneous systemsACM SIGPLAN Notices10.1145/3140582.308104052:5(11-20)Online publication date: 21-Jun-2017
https://dl.acm.org/doi/10.1145/3140582.3081040
Show More Cited By

Index Terms

Opportunity for compute partitioning in pursuit of energy-efficient systems
1. Computer systems organization
  1. Architectures
    1. Other architectures

Recommendations

Opportunity for compute partitioning in pursuit of energy-efficient systems
LCTES 2016: Proceedings of the 17th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools, and Theory for Embedded Systems

Performance of computing systems, from handhelds to supercomputers, is increasingly constrained by the energy consumed. A significant and increasing fraction of the energy is consumed in the movement of data. In a compute node, caches have been very ...
Location-aware cache management for many-core processors with deep cache hierarchy
SC '13: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

As cache hierarchies become deeper and the number of cores on a chip increases, managing caches becomes more important for performance and energy. However, current hardware cache management policies do not always adapt optimally to the applications ...
Imbalanced cache partitioning for balanced data-parallel programs
MICRO-46: Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture

This paper investigates partitioning the ways of a shared last-level cache among the threads of a symmetric data-parallel application running on a chip-multiprocessor. Unlike prior work on way-partitioning for unrelated threads in a multiprogramming ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 51, Issue 5

LCTES '16

May 2016

122 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2980930

Editor:
Andy Gill
University of Kansas, Lawrence, KS

Issue’s Table of Contents

LCTES 2016: Proceedings of the 17th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, Tools, and Theory for Embedded Systems
June 2016
122 pages
ISBN:9781450343169
DOI:10.1145/2907950
General Chair:
Tei-Wei Kuo,
Program Chair:
David B. Whalley

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2016

Published in SIGPLAN Volume 51, Issue 5

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
139
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)2

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sun WLi ZYin SWei SLiu LMartínez JDuato JJohn L(2021)ABC-DIMMProceedings of the 48th Annual International Symposium on Computer Architecture10.1109/ISCA52012.2021.00027(237-250)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1109/ISCA52012.2021.00027
Sun WLi ZYin SWei SLiu L(2021)ABC-DIMM: Alleviating the Bottleneck of Communication in DIMM-based Near-Memory Processing with Inter-DIMM Broadcast2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA)10.1109/ISCA52012.2021.00027(237-250)Online publication date: Jun-2021
https://doi.org/10.1109/ISCA52012.2021.00027
Taylor BMarco VWang Z(2017)Adaptive optimization for OpenCL programs on embedded heterogeneous systemsACM SIGPLAN Notices10.1145/3140582.308104052:5(11-20)Online publication date: 21-Jun-2017
https://dl.acm.org/doi/10.1145/3140582.3081040
Taylor BMarco VWang ZNagarajan VShao Z(2017)Adaptive optimization for OpenCL programs on embedded heterogeneous systemsProceedings of the 18th ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems10.1145/3078633.3081040(11-20)Online publication date: 21-Jun-2017
https://dl.acm.org/doi/10.1145/3078633.3081040

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Opportunity for compute partitioning in pursuit of energy-efficient systems

Location-aware cache management for many-core processors with deep cache hierarchy

Imbalanced cache partitioning for balanced data-parallel programs