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

Satya Jaswanth Badri

dblp:260/7593 · also SatyaJaswanth Badri · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0001-5800-060XORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 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
1 paper
Embedded and real-time systems · 61% Memory systems · 30% Energy-efficient computing · 9%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
energy-efficient embedded systems
0.712023
Mapi-Pro: An Energy Efficient Memory Mapping Technique for Intermittent Computing · ACM Trans. Archit. Code Optim. 2023
Embedded and real-time systems
intermittent computing
0.712023
Mapi-Pro: An Energy Efficient Memory Mapping Technique for Intermittent Computing · ACM Trans. Archit. Code Optim. 2023
Memory systems
non-volatile memory
0.712023
Mapi-Pro: An Energy Efficient Memory Mapping Technique for Intermittent Computing · ACM Trans. Archit. Code Optim. 2023
Energy-efficient computing › power-performance tradeoff
energy-delay product optimization
0.212023
Mapi-Pro: An Energy Efficient Memory Mapping Technique for Intermittent Computing · ACM Trans. Archit. Code Optim. 2023

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

integer linear programming · 0.7
YearPublicationVenuePosition
2023 Mapi-Pro: An Energy Efficient Memory Mapping Technique for Intermittent Computing
abstract
Battery-less technology evolved to replace battery usage in space, deep mines, and other environments to reduce cost and pollution. Non-volatile memory (NVM) based processors were explored for saving the system state during a power failure. Such devices have a small SRAM and large non-volatile memory. To make the system energy efficient, we need to use SRAM efficiently. So we must select some portions of the application and map them to either SRAM or FRAM. This paper proposes an ILP-based memory mapping technique for intermittently powered IoT devices. Our proposed technique gives an optimal mapping choice that reduces the system’s Energy-Delay Product (EDP). We validated our system using TI-based MSP430FR6989 and MSP430F5529 development boards. Our proposed memory configuration consumes 38.10% less EDP than the baseline configuration and 9.30% less EDP than the existing work under stable power. Our proposed configuration achieves 20.15% less EDP than the baseline configuration and 26.87% less EDP than the existing work under unstable power. This work supports intermittent computing and works efficiently during frequent power failures.
Satya Jaswanth Badri, Mukesh Saini, Neeraj Goel
ACM Trans. Archit. Code Optim.1
2023 An Efficient NVM-Based Architecture for Intermittent Computing Under Energy Constraints
abstract
Batteryless technology evolved to replace battery technology. Nonvolatile memory (NVM)-based processors were explored to store the program state during a power failure. The energy stored in a capacitor is used for a backup during a power failure. Since the size of a capacitor is fixed and limited, the available energy in a capacitor is also limited and fixed. Thus, the capacitor energy is insufficient to store the entire program state during frequent power failures. This article proposes an architecture that assures safe backup of volatile contents during a power failure under energy constraints. Using a proposed dirty block table (DBT) and writeback queue (WBQ), this work limits the number of dirty blocks in the L1 cache at any given time. We further conducted a set of experiments by varying the parameter sizes to help the user make appropriate design decisions concerning their energy requirements. The proposed architecture decreases energy consumption by 17.56%, the number of writes to NVM by 18.97% at last level cache (LLC), and 10.66% at a main-memory level compared to baseline architecture.
Satya Jaswanth Badri, Mukesh Saini, Neeraj Goel
IEEE Trans. Very Large Scale Integr. Syst.1