Abstract
Scratchpad-memory (SPM) based memory hierarchy is a promising alternative to cache-based memory hierarchies, due to the difficulty in scaling caches to processors with high core count. However, explicit data management in software is required on SPM-based memory hierarchies. This paper focuses on optimizing the stack data management on SPM-based multicore processors, as memory accesses to call stack present in most applications. While previous works have developed techniques to enable correct stack pointer management, they have not optimized it. As a result, existing techniques still incur high overhead. This paper proposes an automated compiler-based scheme for efficient pointer management. Our experiments on MiBench benchmarks demonstrate that our scheme almost completely eliminates pointer management overhead. As a result, as compared to the state-of-the-art approach, our approach reduces the average execution time of the benchmarks by 52%. Furthermore, with our approach, the performance of stack management on SPM becomes better than hardware caches on average even with conservative estimates.
Original language | English (US) |
---|---|
Title of host publication | 2016 IEEE 27th International Conference on Application-Specific Systems, Architectures and Processors, ASAP 2016 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 67-74 |
Number of pages | 8 |
Volume | 2016-November |
ISBN (Electronic) | 9781509015030 |
DOIs | |
State | Published - Nov 28 2016 |
Event | 27th IEEE International Conference on Application-Specific Systems, Architectures and Processors, ASAP 2016 - London, United Kingdom Duration: Jul 6 2016 → Jul 8 2016 |
Other
Other | 27th IEEE International Conference on Application-Specific Systems, Architectures and Processors, ASAP 2016 |
---|---|
Country/Territory | United Kingdom |
City | London |
Period | 7/6/16 → 7/8/16 |
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications