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

Nilmini Abeyratne

dblp:130/7744 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · none

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

Systems, architecture and hardware · 4 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
3 papers
Memory systems · 65% Interconnection networks and networks-on-chip · 15% Energy-efficient computing · 6%

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

TopicWeightPapersLastEvidence papers
Memory systems
DRAM
0.712023
Rethinking DRAM's Page Mode With STT-MRAM · IEEE Trans. Computers 2023
Memory systems
non-volatile memory
0.712023
Rethinking DRAM's Page Mode With STT-MRAM · IEEE Trans. Computers 2023
Memory systems › non-volatile memory › magnetic random access memory
STT-MRAM
0.712023
Rethinking DRAM's Page Mode With STT-MRAM · IEEE Trans. Computers 2023
Energy-efficient computing
memory energy efficiency
0.212023
Rethinking DRAM's Page Mode With STT-MRAM · IEEE Trans. Computers 2023
Interconnection networks and networks-on-chip › switch architecture
high-radix switch
0.212014
Quality-of-Service for a High-Radix Switch · DAC 2014
Cloud and datacenter computing
quality of service
0.212014
Quality-of-Service for a High-Radix Switch · DAC 2014
Processor architecture and microarchitecture
many-core architecture
0.212013
Scaling towards kilo-core processors with asymmetric high-radix topologies · HPCA 2013
Interconnection networks and networks-on-chip
network topology
0.212013
Scaling towards kilo-core processors with asymmetric high-radix topologies · HPCA 2013
Integrated circuit design
system-on-chip
0.112014
Quality-of-Service for a High-Radix Switch · DAC 2014
Interconnection networks and networks-on-chip › switch architecture
high-radix router
0.012013
Scaling towards kilo-core processors with asymmetric high-radix topologies · HPCA 2013
Interconnection networks and networks-on-chip
router architecture
0.012013
Scaling towards kilo-core processors with asymmetric high-radix topologies · HPCA 2013

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

architectural simulation · 0.7traffic regulation · 0.2swizzleswitch · 0.2mesh topology · 0.2folded clos topology · 0.2
YearPublicationVenuePosition
2023 Rethinking DRAM's Page Mode With STT-MRAM
abstract
Spin torque magnetic random access memory (STT-MRAM) is a promising candidate for drop-in replacement for DRAM-based main memory because of its higher energy efficiency and similar latency to dynamic random access memory (DRAM). However, simply replacing DRAM with STT-MRAM without optimizations severely limits STT-MRAM from exploiting its full potential. STT-MRAM employs costly sense amplifiers that demand an order of magnitude more area and power than DRAM. To manage the high cost, STT-MRAM shares one sense amplifier across multiple bit-lines, exploiting the non-destructive nature of its read operation. This sense amplifier sharing reduces the size of row buffers; as a result, it incurs higher activation energy and lower performance. Other issues arise if STT-MRAM is required to be compatible with DRAM interfaces and policies. To address these challenges in a cost-effective manner, we propose STT-MRAM ARchiTecture supporting smart activation and sensing (SMART) that, unlike DRAM and conventional STT-MRAM, waits to do bit-line sensing until after receiving a column access command instead of a row activation command. This results in several benefits: larger pages, fewer sense amplifiers, lower activation power, higher bank-level parallelism, shorter latency, fewer address pins, and more efficient repairing of defective columns than conventional STT-MRAM. Our evaluation shows that SMART consumes lower energy while providing higher performance than conventional STT-MRAM and DRAM. Additionally, SMART consumes less area compared to conventional STT-MRAM.
Byoungchan Oh, Nilmini Abeyratne, Nam Sung Kim, Jeongseob Ahn, Ronald G. Dreslinski, Trevor N. Mudge
IEEE Trans. Computers2
2016 Enhancing DRAM Self-Refresh for Idle Power Reduction
abstract
DRAM can enter self-refresh mode to save power during idle periods. But self-refresh mode does not modify or reduce the number of refresh operations, therefore the refresh energy stays the same. We observe that in the self-refresh mode DRAM cells are in two distinct modes, static (idle) and dynamic (refreshing), and that the switching between these modes are predictable. In this paper, we propose two new self-refresh modes to improve the power efficiency of DRAM: Enhanced Self-Refresh (ESR) and Long latency Self-Refresh (LSR). The key idea behind our observation is to optimize the leakage current of DRAM cells by selectively applying different voltage levels to the DRAM cell transistors when they are active (accessed for refreshing) and idle (pre-charged) by adjusting both the word-line and body voltages.
Byoungchan Oh, Nilmini Abeyratne, Jeongseob Ahn, Ronald G. Dreslinski, Trevor N. Mudge
ISLPED2
2014 Quality-of-Service for a High-Radix Switch
abstract
Communication in multi-processor systems-on-chip requires guaranteed throughput and latency. If the network is unaware of ongoing communication patterns, applications may not receive their necessary bandwidth or may suffer high network latencies. Many techniques have been proposed to provide quality-of-service (QoS) in the network by regulating network traffic; however, as network sizes have increased, the complexity of these techniques has grown as well, particularly in the case of multi-hop networks.
Nilmini Abeyratne, Supreet Jeloka, Yiping Kang, David T. Blaauw, Ronald G. Dreslinski, Reetuparna Das, Trevor N. Mudge
DAC1
2013 Scaling towards kilo-core processors with asymmetric high-radix topologies
abstract
In this paper, we explore the challenges in scaling on-chip networks towards kilo-core processors. Current low-radix topologies optimize for fast local communication, but do not scale well to kilo-core systems because of the large number of routers required. These increase both power and hop count. In contrast, symmetric high-radix topologies optimize for global communication with fewer hop counts, but degrade local communication with their large, slow routers. To address both local and global communication optimizations independently, we decouple the interconnect design using asymmetric high-radix topologies. By setting a design goal of matching rauter speed with wire speed, our praposed topologies use fast medium-radix rauters to optimize for local communication and a few slow high-radix rauters that reduce hop count to optimize for global communication. Our asymmetric high-radix designs are enabled by recently praposed SwizzleSwitches, which allow us to achieve peiformance scalability within realistic power budgets. We prapose and evaluate two asymmetric high-radix topologies: Super-Star (asymmetric folded Clos) and Super-StarX (asymmetric folded Clos with superimposed mesh). Our evaluations show that the best performing asymmetric high-radix topology improves average network latency over a mesh by 45% while reducing the power consumption by 40%. When compared to symmetric high-radix topologies network thraughput is improved by 2.9× while still praviding similar latency benefits and power ejficiency.
Nilmini Abeyratne, Reetuparna Das, Qingkun Li, Korey Sewell, Bharan Giridhar, Ronald G. Dreslinski, David T. Blaauw, Trevor N. Mudge
HPCA1