Title | A Software Solution for Dynamic Stack Management on Scratch Pad Memory |
Author | Arun Kannan, *Aviral Shrivastava, Amit Pabalkar, Jong-eun Lee (Arizona State University, United States) |
Page | pp. 612 - 617 |
Keyword | scratch pad, cache, stack, power, compiler |
Abstract | We propose a dynamic scratch pad memory (SPM) management scheme for program stack data for processor power reduction. As opposed to previous efforts, our solution does not mandate any hardware changes, does not need profile information, and SPM size at compile-time, and seamlessly integrates support for recursive functions. Our technique manages stack frames on SPM using a scratch pad memory manager (SPMM), integrated into the application binary by the compiler. Our experiments on benchmarks from MiBench [18] show average energy savings of 37% along with a performance improvement of 18%. |
Title | Compiler-Managed Register File Protection for Energy-Efficient Soft Error Reduction |
Author | Jongeun Lee, *Aviral Shrivastava (Arizona State University, United States) |
Page | pp. 618 - 623 |
Keyword | soft error, register file, power-efficient, compiler, register allocation |
Abstract | For embedded systems where neither energy nor reliability
can be easily sacrificed, we present an energy efficient soft error
protection scheme for register files (RF). Unlike previous approaches, our method explicitly optimizes for energy efficiency and exploits the fundamental tradeoff between reliability and energy. While even simple compiler-managed RF protection scheme is more energy efficient than hardware schemes, this work formulates and solves further compiler optimization problems to significantly enhance the energy efficiency of RF protection schemes by an additional 24%. |
Title | Code Decomposition and Recomposition for Enhancing Embedded Software Performance |
Author | *Youngchul Cho (SAIT, Samsung Electoronics, Republic of Korea), Kiyoung Choi (Seoul National University, Republic of Korea) |
Page | pp. 624 - 629 |
Keyword | code transformation, code decomposition and recomposition, control-flow analysis, multitasking, code serialization |
Abstract | Multitasking of concurrent processes implements the concurrency inherited from applications, increasing the utilization of limited resources. It requires an operating system and imposes significant runtime overhead. Serializing multitasking codes removes the need of operating system and the overhead as well. In this paper, we propose a software synthesis method to transform multitasking codes into a single process code. For this, we decompose multitasking codes into a set of code fractions and then recompose the code fractions into a single process code, preserving the functionality of the original codes. We present two different techniques for the transformation - code partitioning and code covering - and propose a hybrid technique that combines the two techniques. |