Balanced loop retiming to effectively architect STT-RAM-based hybrid cache for VLIW processors

Abstract

Loop retiming has been extensively studied to maximize instruction-level parallelism (ILP) of multiple function units by rearranging the dependence delays in a uniform loop. Recently loop retiming technique has been proposed to mitigate the migration overhead of STT-RAM-based hybrid cache by changing the interleaved read and write memory access pattern. However, the previous ILP-aware loop retiming is unaware of its impact on the hybrid cache's migration while the migration-aware loop retiming has not fully considered the parallelism of arithmetic and logical units (ALUs) in VLIW processors. This paper models the impacts of loop retiming on both ILP of ALUs and migration overhead in STT-RAM-based hybrid cache. An overall balanced loop retiming solution, considering both of the ALU part and the memory part, is devised to achieve high performance for VLIW processors. The experimental results across a set of benchmarks show that the proposed balanced retiming approach improves performance by 13.1%, 3.5% and 18.1% on average over the cases with no retiming, pure migration-aware retiming and pure ILPaware retiming, respectively.

Statistical Behavior Guided Block Allocation in Hybrid Cache-Based Edge Computing for Cyber-Physical-Social Systems

“…However, frequently migrating data in the hybrid cache incurs significant performance and energy overhead. Another researchers used the compilation techniques to optimize the block allocation or migration overhead for hybrid cache with static hints [18]- [20].…”

“…Some approaches incur frequent block migrations which cause migration overheads [12], [16], [17]. Some compilation techniques require the compiler to provide static hints [18]- [20], which are impractical in some cases. Recent work proposes a trace-based prediction hybrid cache to predict write burst blocks dynamically [21], but this design brings significant overhead that can not be ignored.…”