Kishor Kunal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kishor Kunal has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Sachin S. Sapatnekar
Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, USA
4 shared publications - Arvind Kumar Sharma
Semiconductor Technology and Systems Department, Imec, Leuven, Belgium
2 shared publications - Jitesh Poojary
University of Minnesota, Minneapolis, MN, USA
2 shared publications - Ramesh Harjani
University of Minnesota, Minneapolis, MN, USA
2 shared publications - Ramprasath Srinivasa Gopalakrishnan
Indian Institute of Technology Madras, Chennai, TN, India
2 shared publications - Austin Rovinski
New York University, New York, NY, USA
1 shared publication
Latest Publications
- Open Access
- 2 September 2026
- Published by Qeios Ltd
Review of: "vPID: Virtual Processing-In-Disk Architecture for Sub-Millisecond Multi-Model LLM Inference Switching"
This paper presents a clever VPID (Virtual Processing-In-Disk). By treating NVMe storage as persistent memory via memory-mapped I/O, the system bypasses traditional model reloading, enabling ultra-low latency switches and $O(1)$ context queries throu...- 2 September 2026
- Published by Qeios Ltd
Open AccessReview of: "vPID: Virtual Processing-In-Disk Architecture for Sub-Millisecond Multi-Model LLM Inference Switching"
This paper presents a clever VPID (Virtual Processing-In-Disk). By treating NVMe storage as persistent memory via memory-mapped I/O, the system bypasses traditional model reloading, enabling ultra-low latency switches and $O(1)$ context queries throu... - 20 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 61 (6) , 2951-2964
Distance-Dependent Variations in FinFETs and Its Impact on Analog Circuit Design
Analog circuits, including amplifiers, comparators, and data converters, are highly sensitive to device mismatches, particularly in differential pairs and current mirrors. Intra-die process variations, both random and distance-dependent, are primary contributors to these mismatches. While random variations are well modeled by the SPICE models in the process design kit (PDK) and utilized by designers during transistor sizing, distance-dependent variations are not as accurately modeled. Consequently, designers often employ complex layout patterns, such as common-centroid (CC) and interdigitated (ID), regardless of necessity. These patterns can result in a larger area and increased parasitics compared to clustered (NonCC) patterns, especially in advanced technology nodes. In this article, we present our chip design and mismatch measurement results from multiple dies fabricated using a 12-nm fin field-effect transistor (FinFET) technology. We specifically measure both distance-dependent and random variations, comparing the mismatch across various layout patterns. Our findings are used to develop design methodologies for operational transconductance amplifiers (OTAs) and current-steering digital-to-analog converters (DACs). We demonstrate that for OTAs and low-resolution DACs, CC, ID, and non-CC patterns exhibit similar mismatch levels, with NonCC offering reduced area and complexity. For high-resolution DACs, however, CC and ID patterns perform better, though distance-dependent mismatch remains significant and must also be considered during circuit sizing.
- 20 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 61 (6) , 2951-2964
Distance-Dependent Variations in FinFETs and Its Impact on Analog Circuit Design
Analog circuits, including amplifiers, comparators, and data converters, are highly sensitive to device mismatches, particularly in differential pairs and current mirrors. Intra-die process variations, both random and distance-dependent, are primary contributors to these mismatches. While random variations are well modeled by the SPICE models in the process design kit (PDK) and utilized by designers during transistor sizing, distance-dependent variations are not as accurately modeled. Consequently, designers often employ complex layout patterns, such as common-centroid (CC) and interdigitated (ID), regardless of necessity. These patterns can result in a larger area and increased parasitics compared to clustered (NonCC) patterns, especially in advanced technology nodes. In this article, we present our chip design and mismatch measurement results from multiple dies fabricated using a 12-nm fin field-effect transistor (FinFET) technology. We specifically measure both distance-dependent and random variations, comparing the mismatch across various layout patterns. Our findings are used to develop design methodologies for operational transconductance amplifiers (OTAs) and current-steering digital-to-analog converters (DACs). We demonstrate that for OTAs and low-resolution DACs, CC, ID, and non-CC patterns exhibit similar mismatch levels, with NonCC offering reduced area and complexity. For high-resolution DACs, however, CC and ID patterns perform better, though distance-dependent mismatch remains significant and must also be considered during circuit sizing.
- Open Access
- 16 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 152-162
LEGO-Size: LLM-Enhanced GPU-Optimized Signoff-Accurate Differentiable VLSI Gate Sizing in Advanced Nodes
- 16 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 152-162
Open AccessLEGO-Size: LLM-Enhanced GPU-Optimized Signoff-Accurate Differentiable VLSI Gate Sizing in Advanced Nodes
- Open Access
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Generative Methods in EDA: Innovations in Dataset Generation and EDA Tool Assistants
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessGenerative Methods in EDA: Innovations in Dataset Generation and EDA Tool Assistants
- 11 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (9) , 2801-2814
GNN-Based Hierarchical Annotation for Analog Circuits
Analog designs consist of multiple hierarchical functional blocks. Each block can be built using one of several design topologies, where the choice of topology is based on circuit performance requirements. A major challenge in automating analog design is in the identification of these functional blocks, which enables the creation of hierarchical netlist representations. This can facilitate a variety of design automation tasks, such as circuit layout optimization, because the layout is dictated by constraints at each level, such as symmetry requirements, that depend on the topology of the hierarchical block. Traditional graph-based methods find it hard to automatically identify the large number of structural variants of each block. To overcome this limitation, this article leverages recent advances in graph neural networks (GNNs). A variety of GNN strategies is used to identify netlist elements for circuit functional blocks at higher levels of the design hierarchy, where numerous design variants are possible. At lower levels of hierarchy, where the degrees of freedom in circuit topology is limited, structures are identified using graph-based algorithms. The proposed hierarchical recognition scheme enables the identification of layout constraints, such as symmetry and matching, which enable high-quality hierarchical layouts. This method is scalable across a wide range of analog designs. An experimental evaluation shows a high degree of accuracy over a wide range of analog designs, identifying functional blocks, such as low-noise amplifiers, operational transconductance amplifiers, mixers, oscillators, and band-pass filters, in larger circuits.
- 11 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (9) , 2801-2814
GNN-Based Hierarchical Annotation for Analog Circuits
Analog designs consist of multiple hierarchical functional blocks. Each block can be built using one of several design topologies, where the choice of topology is based on circuit performance requirements. A major challenge in automating analog design is in the identification of these functional blocks, which enables the creation of hierarchical netlist representations. This can facilitate a variety of design automation tasks, such as circuit layout optimization, because the layout is dictated by constraints at each level, such as symmetry requirements, that depend on the topology of the hierarchical block. Traditional graph-based methods find it hard to automatically identify the large number of structural variants of each block. To overcome this limitation, this article leverages recent advances in graph neural networks (GNNs). A variety of GNN strategies is used to identify netlist elements for circuit functional blocks at higher levels of the design hierarchy, where numerous design variants are possible. At lower levels of hierarchy, where the degrees of freedom in circuit topology is limited, structures are identified using graph-based algorithms. The proposed hierarchical recognition scheme enables the identification of layout constraints, such as symmetry and matching, which enable high-quality hierarchical layouts. This method is scalable across a wide range of analog designs. An experimental evaluation shows a high degree of accuracy over a wide range of analog designs, identifying functional blocks, such as low-noise amplifiers, operational transconductance amplifiers, mixers, oscillators, and band-pass filters, in larger circuits.
- 27 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (12) , 4844-4857
A Unified Engine for Accelerating GNN Weighting/Aggregation Operations, With Efficient Load Balancing and Graph-Specific Caching
Graph neural networks (GNN) analysis engines are vital for real-world problems that use large graph models. Challenges for a GNN hardware platform include the ability to (a) host a variety of GNNs, (b) handle high sparsity in input vertex feature vectors and the graph adjacency matrix and the accompanying random memory access patterns, and (c) maintain load-balanced computation in the face of uneven workloads, induced by high sparsity and power-law vertex degree distributions. This paper proposes GNNIE, an accelerator designed to run a broad range of GNNs. It tackles workload imbalance by (i) splitting vertex feature operands into blocks, (ii) reordering and redistributing computations, (iii) using a novel flexible MAC architecture. It adopts a graph-specific, degree-aware caching policy that is well suited to real-world graph characteristics. The policy enhances on-chip data reuse and avoids random memory access to DRAM. GNNIE achieves average speedups of 7197× over a CPU and 17.81× over a GPU over multiple datasets on graph attention networks (GATs), graph convolutional networks (GCNs), GraphSAGE, GINConv, and DiffPool. Compared to prior approaches, GNNIE achieves an average speedup of 5× over HyGCN (which cannot implement GATs) for GCN, GraphSAGE, and GINConv. GNNIE achieves an average speedup of 1.3× over AWB-GCN (which runs only GCNs), despite using 3.4× fewer processing units.
- 27 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 42 (12) , 4844-4857
A Unified Engine for Accelerating GNN Weighting/Aggregation Operations, With Efficient Load Balancing and Graph-Specific Caching
Graph neural networks (GNN) analysis engines are vital for real-world problems that use large graph models. Challenges for a GNN hardware platform include the ability to (a) host a variety of GNNs, (b) handle high sparsity in input vertex feature vectors and the graph adjacency matrix and the accompanying random memory access patterns, and (c) maintain load-balanced computation in the face of uneven workloads, induced by high sparsity and power-law vertex degree distributions. This paper proposes GNNIE, an accelerator designed to run a broad range of GNNs. It tackles workload imbalance by (i) splitting vertex feature operands into blocks, (ii) reordering and redistributing computations, (iii) using a novel flexible MAC architecture. It adopts a graph-specific, degree-aware caching policy that is well suited to real-world graph characteristics. The policy enhances on-chip data reuse and avoids random memory access to DRAM. GNNIE achieves average speedups of 7197× over a CPU and 17.81× over a GPU over multiple datasets on graph attention networks (GATs), graph convolutional networks (GCNs), GraphSAGE, GINConv, and DiffPool. Compared to prior approaches, GNNIE achieves an average speedup of 5× over HyGCN (which cannot implement GATs) for GCN, GraphSAGE, and GINConv. GNNIE achieves an average speedup of 1.3× over AWB-GCN (which runs only GCNs), despite using 3.4× fewer processing units.