Journal of Applied Sciences ›› 2010, Vol. 28 ›› Issue (2): 175-181.
• Computer Science and Applications • Previous Articles Next Articles
Received:
Revised:
Online:
Published:
Abstract:
In this paper, an allocation strategy is proposed to optimize energy of memory system. A timeslotted cache conflict graph is proposed to model the behavior of data cache conflict. An integer nonlinear programming (INP) is implemented, which can avoid time-consuming linearization process, to select the most profitable data pages and employ a virtual memory system to remap those data pages that can cause severe cache conflict within a time slot, to the on-chip scratchpad memory (SPM). To minimize the swapping overhead of dynamic SPM allocation, we introduce a novel SPM controller with a tightly coupled DMA to issue the swapping operations without CPU intervention. The proposed method can optimize all data segments including global data, heap and stack data in general, and reduce the total energy consumption by 24.83% on average without any performance degradation.
Key words: time-slotted Cache conflict graph, SPM controller, energy optimization
CLC Number:
TP302
WANG Huan, LING Ming, ZHANG Yang, MEI Chen. Energy-Oriented Dynamic SPM Allocation Based on Time-Slotted Cache Conflict Graph[J]. Journal of Applied Sciences, 2010, 28(2): 175-181.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jas.shu.edu.cn/EN/
https://www.jas.shu.edu.cn/EN/Y2010/V28/I2/175