Prasanth Mangalagiri

dblp:90/2640 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
1since 2021 · last 2024
0009-0000-3396-0882ORCID · corroborated

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

Systems, architecture and hardware · 9 · 4 first-author · 1 since 2021Security and privacy · 1Software engineering, systems software and programming languages · 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
4 papers
Electronic design automation · 51% Hardware reliability and fault tolerance · 27% Reconfigurable computing and FPGAs · 12%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA reliability
0.122008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
FLAW: FPGA lifetime awareness · DAC 2006
Hardware reliability and fault tolerance › aging
time-dependent dielectric breakdown
0.122008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
FLAW: FPGA lifetime awareness · DAC 2006
Electronic design automation › design automation tools › accelerator design automation
automated accelerator generation
0.112009
An Automated Framework for Accelerating Numerical Algorithms on Reconfigurable Platforms Using Algorithmic/Architectural Optimization · IEEE Trans. Computers 2009
Reconfigurable computing and FPGAs
FPGA accelerator
0.112009
An Automated Framework for Accelerating Numerical Algorithms on Reconfigurable Platforms Using Algorithmic/Architectural Optimization · IEEE Trans. Computers 2009
Hardware reliability and fault tolerance
aging and degradation
0.112008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
Hardware reliability and fault tolerance › aging
electromigration
0.112008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
Storage systems › flash and SSD
lifetime extension
0.112008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
Hardware reliability and fault tolerance
aging
0.112006
FLAW: FPGA lifetime awareness · DAC 2006
Hardware reliability and fault tolerance › aging
FPGA aging
0.112006
FLAW: FPGA lifetime awareness · DAC 2006
Hardware reliability and fault tolerance › aging
hot-carrier effect
0.012008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
Hardware reliability and fault tolerance › aging › transistor aging
negative bias temperature instability
0.012008
Toward Increasing FPGA Lifetime · IEEE Trans. Dependable Secur. Comput. 2008
Hardware reliability and fault tolerance
hard errors
0.012006
FLAW: FPGA lifetime awareness · DAC 2006

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

machine learning · 0.8generative AI · 0.8fixed-point and floating-point representation exploration · 0.1algorithmic/architectural co-optimization · 0.1reliability modeling · 0.1degradation analysis · 0.1lifetime-aware design · 0.1
YearPublicationVenuePosition
2024 CDLS: Constraint Driven Generative AI Framework for Analog Layout Synthesis
abstract
In advanced process technology nodes, analog circuit performance is intrinsically linked to layout parasitics and layout dependent effects (LDE). In contrast to digital designs, layout generation for analog mixed signal circuits remains predominantly a slow manual task, impeding rapid design convergence. To address this bottleneck, we introduce CDLS - a Constraint Driven Generative AI Framework for Analog Layout Synthesis. CDLS is fundamentally a constraint driven framework that enables analog circuit designers to auto-generate simulation-ready layout. Unlike traditional algorithmic approaches, CDLS uses generative AI and machine learning techniques to generate key design constraints that drive the quality of autogenerated placement and routing. Using CDLS, on average we reduce layout iteration time by 2-3X on industrial designs. By reducing the turn-around-time on layout iterations we estimate a 30% reduction to overall design convergence cycle. We also demonstrate that the quality of results achieved through CDLS is on par with manually drawn layout on state-of-the-art analog designs developed on an Intel sub-10nm process technology node.
Prasanth Mangalagiri, Lynn Qian, Farrukh Zafar, Praveen Mosalikanti, Phoebe Chang, Arun Kurian, Vinay Saripalli
DAC1
2019 Analog Layout Synthesis: Are We There Yet?
abstract
Over the past decade, spurred by advances in mobile computing, there has been a fundamental shift in computing needs of consumer applications. There has been an industry-wide transition from highly CPU-centric to a peripheral-centric, connectivity and data-driven computing. This has paved way to the resurgence of Analog Mixed Signal Designs in both system-on-chip, and core computing architectures. However, the design automation capabilities used in production analog design flows have remained primarily manual with assisted-automation. Analog layout design and layout parasitic dependent circuit convergence remain a key bottleneck in industrial analog IP design.
Prasanth Mangalagiri
ISPD1
2009 Exploiting clock skew scheduling for FPGA
abstract
Clock skew scheduling (CSS) is an effective technique to optimize clock period of sequential designs. However, these techniques are not effective in the presence of certain design structural constraints that limit the CSS. In this paper, we present an analysis of several design structural constraints that affect the CSS and propose techniques to resolve these constraints. Furthermore, we propose a CSS FPGA architecture and a novel clock-period optimization (CPO) flow that tackles some of these constraints by exploiting the re-configurability of FPGAs. Experimental results demonstrate that the proposed FPGA architecture with the CPO flow achieved an average performance improvement of 24.4% which was an average performance improvement of 10.7% over the CPO flow without considering the constraints.
Sungmin Bae, Prasanth Mangalagiri, Narayanan Vijaykrishnan
DATE2
2009 An Automated Framework for Accelerating Numerical Algorithms on Reconfigurable Platforms Using Algorithmic/Architectural Optimization
abstract
This paper describes TANOR, an automated framework for designing hardware accelerators for numerical computation on reconfigurable platforms. Applications utilizing numerical algorithms on large-size data sets require high-throughput computation platforms. The focus is on N-body interaction problems which have a wide range of applications spanning from astrophysics to molecular dynamics. The TANOR design flow starts with a MATLAB description of a particular interaction function, its parameters, and certain architectural constraints specified through a graphical user interface. Subsequently, TANOR automatically generates a configuration bitstream for a target FPGA along with associated drivers and control software necessary to direct the application from a host PC. Architectural exploration is facilitated through support for fully custom fixed-point and floating-point representations in addition to standard number representations such as single-precision floating point. Moreover, TANOR enables joint exploration of algorithmic and architectural variations in realizing efficient hardware accelerators. TANOR's capabilities have been demonstrated for three different N-body interaction applications: the calculation of gravitational potential in astrophysics, the diffusion or convolution with Gaussian kernel common in image processing applications, and the force calculation with vector-valued kernel function in molecular dynamics simulation. Experimental results show that TANOR-generated hardware accelerators achieve lower resource utilization without compromising numerical accuracy, in comparison to other existing custom accelerators.
Jungsub Kim, Lanping Deng, Prasanth Mangalagiri, Kevin M. Irick, Kanwaldeep Sobti, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Chaitali Chakrabarti, Nikos Pitsianis, Xiaobai Sun
IEEE Trans. Computers3
2008 A low-power phase change memory based hybrid cache architecture
abstract
Sub-threshold leakage in SRAM based cache memories is becoming a predominant source of power consumption in deep-sub micron CMOS designs. Phase Change Random Access Memory (PRAM), a high density, fast access, non-volatile memory is being considered as a candidate for future universal memory technologies. In this paper, we investigate the architectural challenges in integrating a PRAM based memory into the conventional cache hierarchy. First, we develop PRAM cache delay and energy models. We then propose a hybrid PRAM architecture for L1 instruction caches on embedded processors. We also propose a PRAM based unified cache architecture for L2 caches on high-end microprocessors. Finally, we evaluate the proposed architectures, in terms of area, performance, and energy. The experimental results show that the PRAM based cache architectures achieve close to 80% reduction in the leakage energy consumption of a L1-L2 cache hierarchy.
Prasanth Mangalagiri, Karthik Sarpatwari, Aditya Yanamandra, Narayanan Vijaykrishnan, Yuan Xie 0001, Mary Jane Irwin, Osama Awadel Karim
ACM Great Lakes Symposium on VLSI1
2008 Thermal-aware reliability analysis for platform FPGAs
abstract
Increasing levels of integration in Field Programmable Gate Arrays, have resulted in high on-chip power densities, and temperatures. The heterogeneity of components and scaled feature sizes in Platform FPGAs have made them vulnerable to various temperature dependent failure mechanisms. Hence, we need to introduce temperature awareness in tackling such failures that affect the lifetime reliability of FPGAs. In this paper, we present a Dynamic Thermal-aware Reliability Management (DTRM) framework to analyze the impact of temperature variations on the longterm/lifetime reliability of Platform FPGAs. We first study the temperature variations, both across and with-in designs, due to the use of various hard-blocks within a 65nm Platform FPGA. In the presence of such variations, we demonstrate the vulnerability of Platform FPGAs to two different hard-failures, namely, Electromigration, and Time Dependent Dielectric Breakdown (TDDB). We also analyze the performance degradation caused by Negative Bias Temperature Instability (NBTI) in the presence of thermal-variations. We validate the temperature variations estimated by the DTRM framework using a ring oscillator based real-time temperature measurement technique.
Prasanth Mangalagiri, Sungmin Bae, Krishnan Ramakrishnan, Yuan Xie 0001, Narayanan Vijaykrishnan
ICCAD1
2008 Toward Increasing FPGA Lifetime
abstract
Field-Programmable Gate Arrays (FPGAs) have been aggressively moving to lower gate length technologies. Such a scaling of technology has an adverse impact on the reliability of the underlying circuits in such architectures. Various different physical phenomena have been recently explored and demonstrated to impact the reliability of circuits in the form of both transient error susceptibility and permanent failures. In this work, we analyze the impact of two different types of hard errors, namely, Time- Dependent Dielectric Breakdown (TDDB) and Electromigration (EM) on FPGAs. We also study the performance degradation of FPGAs over time caused by Hot-Carrier Effects (HCE) and Negative Bias Temperature Instability (NBTI). Each study is performed on the components of FPGAs most affected by the respective phenomena, from both the performance and reliability perspective. Different solutions are demonstrated to counter each failure and degradation phenomena to increase the operating lifetime of the FPGAs.
Suresh Srinivasan, Krishnan Ramakrishnan, Prasanth Mangalagiri, Yuan Xie 0001, Narayanan Vijaykrishnan, Mary Jane Irwin, Karthik Sarpatwari
IEEE Trans. Dependable Secur. Comput.3
2007 TANOR: A Tool for Accelerating N-Body Simulations on Reconfigurable Platforms
abstract
Algorithm-architecture co-exploration is hindered by the lack of efficient tools. As a consequence, designers are currently able to explore only a limited set of points in the whole design space. Therefore, a tool that can allow fast exploration of algorithmic and architectural tradeoffs in an automated manner is highly desired. In this paper, we describe TANOR an automated tool targeted for designing hardware accelerators for the class of N-body interaction problems. The design flow, starting from a high level (MATLAB) description, configures the entire system automatically. We describe the design of TANOR and demonstrate the effectiveness and adaptability of our tool using three different target applications, namely, the gravitational kernel used in astrophysics, the gaussian kernel common in image processing applications, and a force calculation kernel applied in molecular dynamics. Our results demonstrate that TANOR generates hardware accelerator that are competitive with existing custom accelerator.
Jungsub Kim, Prasanth Mangalagiri, Kevin M. Irick, Mahmut T. Kandemir, Narayanan Vijaykrishnan, Kanwaldeep Sobti, Lanping Deng, Chaitali Chakrabarti, Nikos Pitsianis, Xiaobai Sun
FPL2
2007 FPGA routing architecture analysis under variations
abstract
Systems with the combined features of ASICs and field programmable gate arrays(FPGAs) are increasingly being considered as technology forerunners looking at their extraordinary benefits. This drags FPGAs into the technology scaling race along with ASICs exposing the FPGA industries to the problems associated with scaling. Extensive process variations is one such issue which directly impacts the profit margins of hardware design beyond 65 nm gate length technology. Since the resources in FPGAs are primarily dominated by the interconnect fabric, variations in the interconnect impacting the critical path timing and leakage yield needs rigorous analysis. In this work we provide a statistical modeling of individual routing components in an FPGA followed by a statistical methodology to analyze the timing and leakage distribution. This statistical model is incorporated into the routing algorithm to model a new statistically intelligent routing algorithm (SIRA), which simultaneously optimizes the leakage and timing yield of the FPGA device. We demonstrate and average leakage yield increase of 9% and timing yield by 11% using our final algorithm.
Suresh Srinivasan, Prasanth Mangalagiri, Yuan Xie 0001, Narayanan Vijaykrishnan
ICCD2
2006 FLAW: FPGA lifetime awareness
abstract
Aggressive scaling of technology has an adverse impact on the reliability of VLSI circuits. Apart from increasing transient error susceptibility, the circuits also become more vulnerable to permanent damage and failures due to different physical phenomenon. Such concerns have been recently demonstrated for regular micro-architectures. In this work we demonstrate the vulnerability of Field Programmable Gate Arrays (FPGA)s to two different types of hard errors, namely, Time Dependent Dielectric Breakdown (TDDB) and Electro-migration. We also analyze the performance degradation of FPGAs over time caused by Hot Carrier Effects (HCE). We also propose three novel techniques to counter such aging based failures and increase the lifetime of the device. Copyright 2006 ACM.
Suresh Srinivasan, Prasanth Mangalagiri, Yuan Xie 0001, Narayanan Vijaykrishnan, Karthik Sarpatwari
DAC2