Nirmal Kumbhare

Nirmal Kumbhare

Auto-generated profile, based on publicly available information

Nirmal Kumbhare

University of Arizona Department of Electrical & Computer Engineering, Tucson, Arizona, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 April 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
SASamet Arda
Samet Arda
ANAnish NK
Anish NK
AGA. Alper Goksoy
A. Alper Goksoy
JMJoshua Mack
Joshua Mack
NKNirmal Kumbhare
Nirmal Kumbhare
UOUmit Ogras
Umit Ogras
Heterogeneous systems-on-chip (SoCs) are highly favorable computing platforms due to their superior performance and energy efficiency potential compared to homogeneous architectures. They can be further tailored to a specific domain of applications by incorporating processing elements (PEs) that accelerate frequently used kernels in these applications. However, this potential is contingent upon optimizing the SoC for the target domain and utilizing its resources effectively at run-time. To this end, system-level design - including scheduling, power-thermal management algorithms and design space exploration studies - plays a crucial role. This paper presents a system-level domain-specific SoC simulation (DS3) framework to address this need. DS3 enables both design space exploration and dynamic resource management for power-performance optimization of domain applications. We showcase DS3 using six real-world applications from wireless communications and radar processing domain. DS3, as well as the reference applications, is shared as open-source software to stimulate research in this area.

16 November 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
JMJoshua Mack
Joshua Mack
RPRuben Purdy
Ruben Purdy
KRKris Rockowitz
Kris Rockowitz
MIMichael Inouye
Michael Inouye
EREdward Richter
Edward Richter
AAAli Akoglu
Ali Akoglu
Neuromorphic architectures have been introduced as platforms for energy-efficient spiking neural network execution. The massive parallelism offered by these architectures has also triggered interest from nonmachine learning application domains. In order to lift the barriers to entry for hardware designers and application developers, we present RANC: a reconfigurable architecture for neuromorphic computing, an opensource highly flexible ecosystem that enables rapid experimentation with neuromorphic architectures in both software via C++ simulation and hardware via FPGA emulation. We present the utility of the RANC ecosystem by showing its ability to recreate behavior of IBM’s TrueNorth and validate with a direct comparison to IBM’s Compass simulation environment and published literature. RANC allows optimizing architectures based on application insights as well as prototyping future neuromorphic architectures that can support new classes of applications entirely. We demonstrate the highly parameterized and configurable nature of RANC by studying the impact of architectural changes on improving application mapping efficiency with quantitative analysis based on Alveo U250 FPGA. We present post routing resource usage and throughput analysis across implementations of synthetic aperture radar classification and vector matrix multiplication applications, and demonstrate a neuromorphic architecture that scales to emulating 259K distinct neurons and 73.3M distinct synapses.

24 January 2023 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
JMJoshua Mack
Joshua Mack
SHSahil Hassan
Sahil Hassan
NKNirmal Kumbhare
Nirmal Kumbhare
MGMiguel Castro Gonzalez
Miguel Castro Gonzalez
AAAli Akoglu
Ali Akoglu
In this work, we present a C ompiler-integrated, E xtensible D omain Specific System on Chip R untime (CEDR) ecosystem to facilitate research toward addressing the challenges of architecture, system software, and application development with distinct plug-and-play integration points in a unified compile time and runtime workflow. We demonstrate the utility of CEDR on the Xilinx Zynq MPSoC-ZCU102 for evaluating performance of pre-silicon hardware in the trade space of SoC configuration, scheduling policy and workload complexity based on dynamically arriving workload scenarios composed of real-life signal processing applications scaling to thousands of application instances with Fast Fourier Transform and matrix multiply accelerators. We provide insights into the tradeoffs present in this design space through a number of distinct case studies. CEDR is portable and has been deployed and validated on Odroid-XU3, X86, and Nvidia Jetson Xavier-based SoC platforms. Taken together, CEDR is a capable environment for enabling research in exploring the boundaries of productive application development, resource management heuristic development, and hardware configuration analysis for heterogeneous architectures.

1 November 2020 in Parallel Computing
Verified
Journal Article
Closed access
NKNirmal Kumbhare
Nirmal Kumbhare
AAAli Akoglu
Ali Akoglu
AMAniruddha Marathe
Aniruddha Marathe
Salim HaririSalim Hariri
Salim Hariri
GAGhaleb Abdulla
Ghaleb Abdulla

16 January 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
NKNirmal Kumbhare
Nirmal Kumbhare
AMAniruddha Marathe
Aniruddha Marathe
AAAli Akoglu
Ali Akoglu
HSHoward Jay Siegel
Howard Jay Siegel
GAGhaleb Abdulla
Ghaleb Abdulla
Salim HaririSalim Hariri
Salim Hariri
In this article, we investigate limitations in the traditional value-based algorithms for a power-constrained HPC system and evaluate their impact on HPC productivity. We expose the trade-off between allocating system-wide power budget uniformly and greedily under different system-wide power constraints in an oversubscribed system. We experimentally demonstrate that, under the tightest power constraint, the mean productivity of the greedy allocation is 38 percent higher than the uniform allocation whereas, under the intermediate power constraint, the uniform allocation has a mean productivity of 6 percent higher than the greedy allocation. We then propose a new algorithm that adapts its behavior to deliver the combined benefits of the two allocation strategies. We design a methodology with online retraining capability to create application-specific power-execution time models for a class of HPC applications. These models are used in predicting the execution time of an application on the available resources at the time of making scheduling decisions in the power-aware algorithms. We evaluate the proposed algorithm using emulation and simulation environments, and show that our adaptive strategy results in improving HPC resource utilization while delivering a mean productivity that is almost the same as the best performing algorithm across various system-wide power constraints.

1 April 2019 in Parallel Computing
Verified
Journal Article
Closed access
DMDylan Machovec
Dylan Machovec
BKBhavesh Khemka
Bhavesh Khemka
NKNirmal Kumbhare
Nirmal Kumbhare
SPSudeep Pasricha
Sudeep Pasricha
AMAnthony A. Maciejewski
Anthony A. Maciejewski
NINeena Imam
Neena Imam