Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Binyamin Frankel

dblp:183/6838 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2023
0000-0002-2448-8755ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Energy-efficient computing · 42% Memory systems · 37% Integrated circuit design · 18%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › DRAM › DRAM architecture
embedded DRAM
1.022023
A Self-Refreshable Bit-Cell for Single-Cycle Refreshing of Embedded Memories · IEEE Trans. Computers 2023
Queuing-Based eDRAM Refreshing for Ultra-Low Power Processors · IEEE Trans. Computers 2018
Energy-efficient computing › memory energy efficiency
low-power memory
0.712023
A Self-Refreshable Bit-Cell for Single-Cycle Refreshing of Embedded Memories · IEEE Trans. Computers 2023
Integrated circuit design
memory circuit design
0.712023
A Self-Refreshable Bit-Cell for Single-Cycle Refreshing of Embedded Memories · IEEE Trans. Computers 2023
Energy-efficient computing › low-power design
low-power processor design
0.522023
Queuing-Based eDRAM Refreshing for Ultra-Low Power Processors · IEEE Trans. Computers 2018
A Self-Refreshable Bit-Cell for Single-Cycle Refreshing of Embedded Memories · IEEE Trans. Computers 2023
Energy-efficient computing › power management
memory power management
0.312018
Queuing-Based eDRAM Refreshing for Ultra-Low Power Processors · IEEE Trans. Computers 2018
Memory systems › DRAM
refresh management
0.312018
Queuing-Based eDRAM Refreshing for Ultra-Low Power Processors · IEEE Trans. Computers 2018
Performance modeling and evaluation
queueing models
0.112018
Queuing-Based eDRAM Refreshing for Ultra-Low Power Processors · IEEE Trans. Computers 2018

Methods — techniques the papers use, named apart from their topics

leakage analysis · 0.7circuit design · 0.7queueing theory · 0.3performance analysis · 0.3
YearPublicationVenuePosition
2023 A Self-Refreshable Bit-Cell for Single-Cycle Refreshing of Embedded Memories
abstract
Power supply voltage reduction is a primary enabler for sustaining the increasing demand for ultra-low power processors. On-die memories, which are traditionally implemented by SRAM, stop functioning properly when the supply voltage is scaled down aggressively; hence, embedded DRAM (eDRAM) bit-cells are used instead. These bit-cells leak their data strongly in one direction, whereas the leakage in the opposite direction is considerably lower. Due to their intrinsic limited Data Retention Time (DRT), these memories require power-hungry refreshing, which degrades performance. In an attempt to extend the DRT of a bit-cell, theoretically to infinity, compounds of various types of storage nodes in a single bit-cell, storing the datum and its complement, were examined here. A rigorous proof shows that under realistic leakage models, there is an inherent incompleteness preventing the proper readout and decision of the stored value after a certain time. Adopting the idea of dual-polarity complementary storage nodes, a new eDRAM self-refreshable bit-cell is proposed that yields a considerably extended DRT. The dual-polarity property enables the refreshing of an entire memory array in a single clock cycle, thus almost nullifying the unavoidable performance loss occurred by row-by-row ordinary power-hungry refreshing.
Binyamin Frankel, Shmuel Wimer
IEEE Trans. Computers1
2023 Energy Efficiency of Opportunistic Refreshing for Gain-Cell Embedded DRAM
abstract
On-die memories, which are traditionally implemented by SRAM, stop functioning properly when the supply voltage is scaled down aggressively; hence, embedded DRAMs (eDRAMs) are used instead. Opportunistic refreshing was proved to eliminate the performance loss incurred by the eDRAM refreshing must. We show here that Gain-Cell eDRAM (GCeDRAM) supplemented with opportunistic refreshing consumes significantly smaller power and energy than SRAM. Analysis supported by hardware simulations demonstrate that the same design point achieves maximum performance and minimum energy. Replacement of the data memory in the ultra-low power processor PULPino from SRAM to opportunistically refreshed GCeDRAM yielded 30% energy savings in the memory, which translated into 7% savings in the entire processor.
Binyamin Frankel, Eyal Sarfati, Davide Rossi 0001, Shmuel Wimer
IEEE Trans. Circuits Syst. I Regul. Pap.1
2018 Queuing-Based eDRAM Refreshing for Ultra-Low Power Processors
abstract
Ultra-low power processors designed to work at very low voltage are the enablers of the internet of things (IoT) era. Their internal memories, which are usually implemented by a static random access memory (SRAM) technology, stop functioning properly at low voltage. Some recent commercial products have replaced SRAM with embedded memory (eDRAM), in which stored data are destroyed overtime, thus requiring periodic refreshing that causes performance loss. This article presents a queuing-based opportunistic refreshing algorithm that eliminates most if not all of the performance loss and is shown to be optimal. The queues used for refreshing miss refreshing opportunities not only when they are saturated but also when they are empty, hence increasing the probability of performance loss. We examine the optimal policy for handling a saturated and empty queue, and the ways in which system performance depends on queue capacity and memory size. This analysis results in a closed-form performance expression capturing read/write probabilities, memory size and queue capacity leading to CPU-internal memory architecture optimization.
Binyamin Frankel, Roi Herman, Shmuel Wimer
IEEE Trans. Computers1