Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems

Energy has emerged as a critical constraint for a large number of portable, wireless devices. For data intensive applications, a significant amount of energy is dissipated in the memory. Advanced memory architectures support multiple power states of memory banks, which can be exploited to reduce energy dissipation in the system. We present a general methodology using combinatorial graph scheduling techniques, which can be used for obtaining efficient memory power management schedules for algorithms. Additional techniques like tiling further improve the efficiency of our approach. Our simulation results show that we can obtain over 98% energy reduction in the memory energy for the Transitive Closure using our methodology.

[1]  Luca Benini,et al.  System-level power optimization: techniques and tools , 2000, Proceedings. 1999 International Symposium on Low Power Electronics and Design (Cat. No.99TH8477).

[2]  Hiroto Yasuura,et al.  Software Energy Reduction Techniques for Variable-Voltage Processors , 2001, IEEE Des. Test Comput..

[3]  David F. Bacon,et al.  Compiler transformations for high-performance computing , 1994, CSUR.

[4]  Mitali Singh,et al.  Algorithmic Techniques for Memory Energy Reduction , 2003, WEA.

[5]  Rajesh Gupta,et al.  Architectural adaptation for power and performance , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).

[6]  Manfred Schlett Trends in Embedded-Microprocessor Design , 1998, Computer.

[7]  Claude Tadonki A Recursive Method for Graph Scheduling , 2002, Sci. Ann. Cuza Univ..

[8]  Rolf Ernst,et al.  Codesign of Embedded Systems: Status and Trends , 1998, IEEE Des. Test Comput..

[9]  Johan Pouwelse,et al.  Dynamic voltage scaling on a low-power microprocessor , 2001, MobiCom '01.

[10]  Sandeep Sen,et al.  Towards a theory of cache-efficient algorithms , 2000, SODA '00.