.png){kind=icon}
Return
Optimal queuing-based memory refreshing algorithm for energy efficient processors
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2018.07.057.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The embedded memories of ultra-low power processors require periodic refreshing, which blocks the CPU-memory access and degrades performance. In addition, refreshing queues cause a drop in system performance not only when they are saturated but also when they are empty. We present an optimal queuing-based opportunistic refreshing algorithm that eliminates performance loss. We analyze system performance dependence on queue capacity and memory size to derive a closed-form performance expression that provides clear guidelines for memory design implementation. Comparison of a hardware implementation in a RISC-V ultra-low power processor to ordinary periodic refreshing demonstrates the algorithm can provide a considerable performance speedup in a wide variety of real applications.
Keywords:
Refreshing
Embedded memories
Queuing
Finite capacity queue
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
Cited Papers
ShareSave
Bimetallic Co/Al nanoparticles in an ionic liquid: synthesis and application in alkyne hydrogenation
PREAI
ShareSaveVibration control of an electrorheological fluid-based suspension system with an energy regenerative mechanism.png)
Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering
Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile EngineeringIF0
PREAI
ShareSave no more
no more