Fast, predictable and low energy memory references through architecture-aware compilation
暂无分享,去创建一个
[1] Peter Marwedel,et al. Assigning program and data objects to scratchpad for energy reduction , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.
[2] Michael Theokharidis. Energiemessung von ARM7TDMI Prozessor-Instruktion , 2005 .
[3] Alexandru Nicolau,et al. Memory Issues in Embedded Systems-on-Chip , 1999 .
[4] Hermann Kopetz,et al. Real-time systems , 2018, CSC '73.
[5] John Arends,et al. Instruction fetch energy reduction using loop caches for embedded applications with small tight loops , 1999, ISLPED '99.
[6] Sang Lyul Min,et al. An Accurate Worst Case Timing Analysis for RISC Processors , 1995, IEEE Trans. Software Eng..
[7] Peter Marwedel,et al. Reducing energy consumption by dynamic copying of instructions onto onchip memory , 2002, 15th International Symposium on System Synthesis, 2002..
[8] Keith D. Cooper,et al. Compiler-controlled memory , 1998, ASPLOS VIII.
[9] Peter Marwedel,et al. Data partitioning for maximal scratchpad usage , 2003, ASP-DAC '03.
[10] Mahmut T. Kandemir,et al. Exploiting scratch-pad memory using Presburger formulas , 2001, International Symposium on System Synthesis (IEEE Cat. No.01EX526).
[11] Frank Vahid,et al. Exploiting Fixed Programs in Embedded Systems: A Loop Cache Example , 2002, IEEE Computer Architecture Letters.
[12] Peter Marwedel,et al. Fast, predictable and low energy memory references through architecture-aware compilation , 2004 .
[13] Steven S. Muchnick,et al. Advanced Compiler Design and Implementation , 1997 .
[14] Peter Marwedel,et al. Cache-aware scratchpad allocation algorithm , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.
[15] D. Parnas,et al. On satisfying timing constraints in hard-real-time systems , 1991, SIGSOFT '91.
[16] P. Gács,et al. Algorithms , 1992 .
[17] Rajeev Barua,et al. An optimal memory allocation scheme for scratch-pad-based embedded systems , 2002, TECS.
[18] Sharad Malik,et al. Performance estimation of embedded software with instruction cache modeling , 1995, ICCAD.
[19] Raimund Kirner,et al. Consideration of Optimizing Compilers in the Context of WCET Analysis , 2000 .
[20] P. Machanick. Approaches to Addressing the Memory Wall , 2022 .
[21] Alan Burns,et al. Pipelined processors and worst case execution times , 1993, Real-Time Systems.
[22] Sharad Malik,et al. Efficient microarchitecture modeling and path analysis for real-time software , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.
[23] Sally A. McKee,et al. Hitting the memory wall: implications of the obvious , 1995, CARN.
[24] Aloysius K. Mok,et al. Evaluating tight execution time bounds of programs by annotations , 1989 .
[25] Sang Lyul Min,et al. Worst case timing analysis of RISC processors: R3000/R3010 case study , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.
[26] Santosh Pande,et al. A Framework for Loop Distribution on Limited On-Chip Memory Processors , 2000, CC.
[27] Peter Marwedel,et al. Scratchpad memory: a design alternative for cache on-chip memory in embedded systems , 2002, Proceedings of the Tenth International Symposium on Hardware/Software Codesign. CODES 2002 (IEEE Cat. No.02TH8627).
[28] Sharad Malik,et al. Cache modeling for real-time software: beyond direct mapped instruction caches , 1996, 17th IEEE Real-Time Systems Symposium.