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.

Aniruddha N. Udipi

dblp:17/1260 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
1since 2021 · last 2023
0009-0000-8282-211XORCID · corroborated

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

Systems, architecture and hardware · 8 · 5 first-author · 1 since 2021Software engineering, systems software and programming languages · 5 · 3 first-author · 1 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
7 papers
Memory systems · 34% Hardware accelerators and domain-specific architectures · 18% Cloud and datacenter computing · 18%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › domain-specific accelerator
compression accelerator
0.712023
CDPU: Co-designing Compression and Decompression Processing Units for Hyperscale Systems · ISCA 2023
Cloud and datacenter computing › datacenter architecture
datacenter tax offload
0.712023
CDPU: Co-designing Compression and Decompression Processing Units for Hyperscale Systems · ISCA 2023
Memory systems › DRAM
DRAM architecture
0.322012
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems · ISCA 2012
Rethinking DRAM design and organization for energy-constrained multi-cores · ISCA 2010
Memory systems
3d-stacked memory
0.212013
Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device · MICRO 2013
Electronic design automation › power integrity
IR-drop
0.212013
Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device · MICRO 2013
Integrated circuit design
power delivery network
0.212013
Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device · MICRO 2013
Hardware reliability and fault tolerance › error-correcting codes for memory
chipkill correct
0.112012
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems · ISCA 2012
Hardware reliability and fault tolerance › error correction
error-correcting codes
0.112012
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems · ISCA 2012
Hardware reliability and fault tolerance
memory reliability
0.112012
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems · ISCA 2012
Memory systems
memory interface
0.112011
Combining memory and a controller with photonics through 3D-stacking to enable scalable and energy-efficient systems · ISCA 2011
Memory systems
cache coherence
0.112010
Towards scalable, energy-efficient, bus-based on-chip networks · HPCA 2010
Memory systems › cache coherence › cache coherence protocol
snoopy coherence
0.112010
Towards scalable, energy-efficient, bus-based on-chip networks · HPCA 2010
Memory systems › memory hierarchy › cache hierarchy
3d stacked cache
0.112009
Optimizing communication and capacity in a 3D stacked reconfigurable cache hierarchy · HPCA 2009
Memory systems › memory hierarchy
cache hierarchy
0.112009
Optimizing communication and capacity in a 3D stacked reconfigurable cache hierarchy · HPCA 2009
Memory systems › cache design
reconfigurable cache
0.112009
Optimizing communication and capacity in a 3D stacked reconfigurable cache hierarchy · HPCA 2009
Energy-efficient computing
power management
0.122013
Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device · MICRO 2013
Rethinking DRAM design and organization for energy-constrained multi-cores · ISCA 2010
Electronic design automation › power integrity
voltage fluctuation
0.012013
Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device · MICRO 2013
Parallel and multicore computing › data distribution
data mapping
0.012012
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems · ISCA 2012
Memory systems
memory controller
0.012012
LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems · ISCA 2012
Integrated circuit design › photonic integrated circuits
silicon photonics
0.012011
Combining memory and a controller with photonics through 3D-stacking to enable scalable and energy-efficient systems · ISCA 2011
Memory systems › DRAM
DRAM energy consumption
0.012010
Rethinking DRAM design and organization for energy-constrained multi-cores · ISCA 2010
Memory systems
memory access latency
0.012010
Rethinking DRAM design and organization for energy-constrained multi-cores · ISCA 2010
Interconnection networks and networks-on-chip › network topology
tree networks
0.012009
Optimizing communication and capacity in a 3D stacked reconfigurable cache hierarchy · HPCA 2009

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

lossless compression · 0.7hardware-software co-design · 0.7simulation · 0.2pin count modeling · 0.2IR-drop analysis · 0.2parity codes · 0.1checksum codes · 0.1low-swing wiring · 0.1bloom filter · 0.1OS page coloring · 0.1
YearPublicationVenuePosition
2023 CDPU: Co-designing Compression and Decompression Processing Units for Hyperscale Systems
abstract
General-purpose lossless data compression and decompression ("(de)compression") are used widely in hyperscale systems and are key "datacenter taxes". However, designing optimal hardware compression and decompression processing units ("CDPUs") is challenging due to the variety of algorithms deployed, input data characteristics, and evolving costs of CPU cycles, network bandwidth, and memory/storage capacities.
Sagar Karandikar, Aniruddha N. Udipi, Junsun Choi, Joonho Whangbo, Jerry Zhao, Svilen Kanev, Edwin Lim, Jyrki Alakuijala, Vrishab Madduri, Sophia Shao, Borivoje Nikolic, Krste Asanovic, Parthasarathy Ranganathan
ISCA2
2014 Simulating DRAM controllers for future system architecture exploration
abstract
Compute requirements are increasing rapidly in systems ranging from mobile devices to servers. These, often massively parallel architectures, put increasing requirements on memory bandwidth and latency. The memory system greatly impacts both system performance and power, and it is key to capture the complex behaviour of the DRAM controller when evaluating CPU and GPU performance. By using full-system simulation, the interactions between the system components is captured. However, traditional DRAM controller models focus on modelling interactions between the controller and the DRAM rather than the interactions with the system. Moreover, the DRAM interactions are modelled on a cycle-by-cycle basis, leading to inflexibility and poor simulation performance. In this work, we present a high-level memory controller model, specifically designed for full-system exploration of future system architectures. Our event-based model is tailored to match a contemporary controller architecture, and captures the most important DRAM timing constraints for current and emerging DRAM interfaces, e.g. DDR3, LPDDR3 and WideIO. We show how our controller leverages the open-source gem5 simulation framework, and compare it to a state-of-the-art DRAM controller simulator. Our results show that our model is 7x faster on average, while maintaining the fidelity of the simulation. To highlight the capabilities of our model, we show that it can be used to evaluate a multi-processor memory system.
Andreas Hansson 0001, Aasheesh Kolli, Thomas F. Wenisch, Aniruddha N. Udipi
ISPASS5
2013 Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device
abstract
Many of the pins on a modern chip are used for power delivery. If fewer pins were used to supply the same current, the wires and pins used for power delivery would have to carry larger currents over longer distances. This results in an "IR-drop" problem, where some of the voltage is dropped across the long resistive wires making up the power delivery network, and the eventual circuits experience fluctuations in their supplied voltage. The same problem also manifests if the pin count is the same, but the current draw is higher. IR-drop can be especially problematic in 3D DRAM devices because (i) low cost (few pins and TSVs) is a high priority, (ii) 3D-stacking increases current draw within the package without providing proportionate room for more pins, and (iii) TSVs add to the resistance of the power delivery network.
Manjunath Shevgoor, Jung-Sik Kim, Niladrish Chatterjee, Rajeev Balasubramonian, Al Davis, Aniruddha N. Udipi
MICRO6
2012 LOT-ECC: Localized and tiered reliability mechanisms for commodity memory systems
abstract
Memory system reliability is a serious and growing concern in modern servers. Existing chipkill-level memory protection mechanisms suffer from several draw-backs. They activate a large number of chips on every memory access - this increases energy consumption, and reduces performance due to the reduction in rank-level parallelism. Additionally, they increase access granularity, resulting in wasted bandwidth in the absence of sufficient access locality. They also restrict systems to use narrow-I/O ×4 devices, which are known to be less energy-efficient than the wider ×8 DRAM devices. In this paper, we present LOT-ECC, a localized and multi-tiered protection scheme that attempts to solve these problems. We separate error detection and error correction functionality, and employ simple checksum and parity codes effectively to provide strong fault-tolerance, while simultaneously simplifying implementation. Data and codes are localized to the same DRAM row to improve access efficiency. We use system firmware to store correction codes in DRAM data memory and modify the memory controller to handle data mapping. We thus build an effective fault-tolerance mechanism that provides strong reliability guarantees, activates as few chips as possible (reducing power consumption by up to 44.8% and reducing latency by up to 46.9%), and reduces circuit complexity, all while working with commodity DRAMs and operating systems. Finally, we propose the novel concept of a heterogeneous DIMM that enables the extension of LOT-ECC to ×16 and wider DRAM parts.
Aniruddha N. Udipi, Naveen Muralimanohar, Rajeev Balasubramonian, Al Davis, Norman P. Jouppi
ISCA1
2011 Combining memory and a controller with photonics through 3D-stacking to enable scalable and energy-efficient systems
abstract
It is well-known that memory latency, energy, capacity, bandwidth, and scalability will be critical bottlenecks in future large-scale systems. This paper addresses these problems, focusing on the interface between the compute cores and memory, comprising the physical interconnect and the memory access protocol. For the physical interconnect, we study the prudent use of emerging silicon-photonic technology to reduce energy consumption and improve capacity scaling. We conclude that photonics are effective primarily to improve socket-edge bandwidth by breaking the pin barrier, and for use on heavily utilized links. For the access protocol, we propose a novel packet based interface that relinquishes most of the tight control that the memory controller holds in current systems and allows the memory modules to be more autonomous, improving flexibility and interoperability. The key enabler here is the introduction of a 3D-stacked interface die that allows both these optimizations without modifying commodity memory dies. The interface die handles all conversion between optics and electronics, as well as all low-level memory device control functionality. Communication beyond the interface die is fully electrical, with TSVs between dies and low-swing wires on-die. We show that such an approach results in substantially lowered energy consumption, reduced latency, better scalability to large capacities, and better support for heterogeneity and interoperability.
Aniruddha N. Udipi, Naveen Muralimanohar, Rajeev Balasubramonian, Al Davis, Norman P. Jouppi
ISCA1
2010 Towards scalable, energy-efficient, bus-based on-chip networks
abstract
It is expected that future on-chip networks for many-core processors will impose huge overheads in terms of energy, delay, complexity, verification effort, and area. There is a common belief that the bandwidth necessary for future applications can only be provided by employing packet-switched networks with complex routers and a scalable directory-based coherence protocol. We posit that such a scheme might likely be overkill in a well designed system in addition to being expensive in terms of power because of a large number of power-hungry routers. We show that bus-based networks with snooping protocols can significantly lower energy consumption and simplify network/protocol design and verification, with no loss in performance. We achieve these characteristics by dividing the chip into multiple segments, each having its own broadcast bus, with these buses further connected by a central bus. This helps eliminate expensive routers, but suffers from the energy overhead of long wires. We propose the use of multiple Bloom filters to effectively track data presence in the cache and restrict bus broadcasts to a subset of segments, significantly reducing energy consumption. We further show that the use of OS page coloring helps maximize locality and improves the effectiveness of the Bloom filters. We also employ low-swing wiring to further reduce the energy overheads of the links. Performance can also be improved at relatively low costs by utilizing more of the abundant metal budgets on-chip and employing multiple address-interleaved buses rather than multiple routers. Thus, with the combination of all the above innovations, we extend the scalability of buses and believe that buses can be a viable and attractive option for future on-chip networks. We show energy reductions of up to 31X on average compared to many state-of-the-art packet switched networks.
Aniruddha N. Udipi, Naveen Muralimanohar, Rajeev Balasubramonian
HPCA1
2010 Rethinking DRAM design and organization for energy-constrained multi-cores
abstract
DRAM vendors have traditionally optimized the cost-per-bit metric, often making design decisions that incur energy penalties. A prime example is the overfetch feature in DRAM, where a single request activates thousands of bit-lines in many DRAM chips, only to return a single cache line to the CPU. The focus on cost-per-bit is questionable in modern-day servers where operating costs can easily exceed the purchase cost. Modern technology trends are also placing very different demands on the memory system: (i)queuing delays are a significant component of memory access time, (ii) there is a high energy premium for the level of reliability expected for business-critical computing, and (iii) the memory access stream emerging from multi-core systems exhibits limited locality. All of these trends necessitate an overhaul of DRAM architecture, even if it means a slight compromise in the cost-per-bit metric.
Aniruddha N. Udipi, Naveen Muralimanohar, Niladrish Chatterjee, Rajeev Balasubramonian, Al Davis, Norman P. Jouppi
ISCA1
2009 Non-uniform power access in large caches with low-swing wires
abstract
Modern processors dedicate more than half their chip area to large L2 and L3 caches and these caches contribute significantly to the total processor power. A large cache is typically split into multiple banks and these banks are either connected through a bus (uniform cache access - UCA) or an on-chip network (non-uniform cache access - NUCA). Irrespective of the cache model (NUCA or UCA), the complex interconnects that must be navigated within large caches are found to be the dominant part of cache access power. While there have been a number of proposals to minimize energy consumption in the inter-bank network, very little attention has been paid to the optimization of intra-bank network power that contributes more than 50% of the total cache dynamic power in large cache banks. In this work we study various mechanisms that introduce low-swing wires inside cache banks as energy saving measures. We propose a novel non-uniform power access design, which when coupled with simple architectural mechanisms, provides the best power-performance tradeoff. The proposed mechanisms reduce cache bank energy by 42% while incurring a minor 1% drop in performance.
Aniruddha N. Udipi, Naveen Muralimanohar, Rajeev Balasubramonian
HiPC1
2009 Optimizing communication and capacity in a 3D stacked reconfigurable cache hierarchy
abstract
Cache hierarchies in future many-core processors are expected to grow in size and contribute a large fraction of overall processor power and performance. In this paper, we postulate a 3D chip design that stacks SRAM and DRAM upon processing cores and employs OS-based page coloring to minimize horizontal communication of cache data. We then propose a heterogeneous reconfigurable cache design that takes advantage of the high density of DRAM and the superior power/delay characteristics of SRAM to efficiently meet the working set demands of each individual core. Finally, we analyze the communication patterns for such a processor and show that a tree topology is an ideal fit that significantly reduces the power and latency requirements of the on-chip network. The above proposals are synergistic: each proposal is made more compelling because of its combination with the other innovations described in this paper. The proposed reconfigurable cache model improves performance by up to 19% along with 48% savings in network power.
Niti Madan, Li Zhao 0002, Naveen Muralimanohar, Aniruddha N. Udipi, Rajeev Balasubramonian, Ravi R. Iyer 0001, Srihari Makineni, Donald Newell
HPCA4