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

Shankar Ganesh Ramasubramanian

dblp:130/1376 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2015
0000-0003-3938-9052ORCID · corroborated

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

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
Memory systems · 54% Hardware reliability and fault tolerance · 23% Integrated circuit design · 12%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory hierarchy
cache hierarchy
0.212014
STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies · ISCA 2014
Memory systems
emerging memory technologies
0.212014
STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies · ISCA 2014
Memory systems › emerging memory technologies › spintronic memory
racetrack memory
0.212014
STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies · ISCA 2014
Memory systems › emerging memory technologies
spintronic memory
0.212014
STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies · ISCA 2014
Integrated circuit design
low-power circuit design
0.212013
Relax-and-retime: a methodology for energy-efficient recovery based design · DAC 2013
Hardware reliability and fault tolerance › error recovery
recovery-based design
0.212013
Relax-and-retime: a methodology for energy-efficient recovery based design · DAC 2013
Hardware reliability and fault tolerance › processor reliability
timing error recovery
0.212013
Relax-and-retime: a methodology for energy-efficient recovery based design · DAC 2013
GPUs and heterogeneous computing
GPU architecture
0.112014
STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies · ISCA 2014
Electronic design automation
logic synthesis
0.012013
Relax-and-retime: a methodology for energy-efficient recovery based design · DAC 2013
Electronic design automation › physical design
timing optimization
0.012013
Relax-and-retime: a methodology for energy-efficient recovery based design · DAC 2013

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

simulation · 0.2voltage overscaling · 0.2retiming · 0.2dual-vth cells · 0.2
YearPublicationVenuePosition
2015 DyReCTape: a <u>dy</u>namically <u>re</u>configurable <u>c</u>ache using domain wall memory <u>tape</u>s
Ashish Ranjan 0001, Shankar Ganesh Ramasubramanian, Rangharajan Venkatesan, Vijay S. Pai, Kaushik Roy 0001, Anand Raghunathan
DATE2
2014 STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies
abstract
General-purpose Graphics Processing Units (GPGPUs) are widely used for executing massively parallel workloads from various application domains. Feeding data to the hundreds to thousands of cores that current GPGPUs integrate places great demands on the memory hierarchy, fueling an ever-increasing demand for on-chip memory. In this work, we propose STAG, a high density, energy-efficient GPGPU cache hierarchy design using a new spintronic memory technology called Domain Wall Memory (DWM). DWMs inherently offer unprecedented benefits in density by storing multiple bits in the domains of a ferromagnetic nanowire, which logically resembles a bit-serial tape. However, this structure also leads to a unique challenge that the bits must be sequentially accessed by performing “shift” operations, resulting in variable and potentially higher access latencies. To address this challenge, STAG utilizes a number of architectural techniques : (i) a hybrid cache organization that employs different DWM bit-cells to realize the different memory arrays within the GPGPU cache hierarchy, (ii) a clustered, bit-interleaved organization, in which the bits in a cache block are spread across a cluster of DWM tapes, allowing parallel access, (iii) tape head management policies that predictively configure DWM arrays to reduce the expected number of shift operations for subsequent accesses, and (iv) a shift aware promotion buffer (SaPB), in which accesses to the DWM cache are predicted based on intra-warp locality, and locations that would incur a large shift penalty are promoted to a smaller buffer. Over a wide range of benchmarks from the Rodinia, ISPASS and Parboil suites, STAG achieves significant benefits in performance (12.1% over SRAM and 5.8% over STT-MRAM) and energy (3.3X over SRAM and 2.6X over STT-MRAM).
Rangharajan Venkatesan, Shankar Ganesh Ramasubramanian, Swagath Venkataramani, Kaushik Roy 0001, Anand Raghunathan
ISCA2
2014 SPINDLE: SPINtronic deep learning engine for large-scale neuromorphic computing
abstract
Deep Learning Networks (DLNs) are bio-inspired large-scale neural networks that are widely used in emerging vision, analytics, and search applications. The high computation and storage requirements of DLNs have led to the exploration of various avenues for their efficient realization. Concurrently, the ability of emerging post-CMOS devices to efficiently mimic neurons and synapses has led to great interest in their use for neuromorphic computing.
Shankar Ganesh Ramasubramanian, Rangharajan Venkatesan, Mrigank Sharad, Kaushik Roy 0001, Anand Raghunathan
ISLPED1
2013 Relax-and-retime: a methodology for energy-efficient recovery based design
abstract
Recovery based design (RBD) is a promising approach for the design of energy-efficient circuits under variations. RBD instruments circuits with mechanisms to identify and correct timing violations, thereby allowing reduced guard bands or design margins. In addition, RBD enables aggressive voltage overscaling to a point where timing errors occur even under nominal conditions. A major barrier to the widespread adoption of RBD is that traditional design practices and synthesis tools result in circuits with so-called"path walls", leading to an explosion in the number of timing errors beyond a certain critical operating voltage. To alleviate this effect, previous techniques focused on combinational circuit optimizations such as sizing, use of dual Vth cells, re-structuring, etc. to favorably reshape the path delay distribution. However, these techniques are limited by the inherent sequential structure of the circuit, which defines the boundaries of the combinational logic.
Shankar Ganesh Ramasubramanian, Swagath Venkataramani, Adithya Parandhaman, Anand Raghunathan
DAC1