Subhankar Pal

Subhankar Pal

Auto-generated profile, based on publicly available information

Subhankar Pal

Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 February 2018
Verified
Conference Paper
Closed access
SPSubhankar Pal
Subhankar Pal
JBJonathan Beaumont
Jonathan Beaumont
DPDong-Hyeon Park
Dong-Hyeon Park
AAAporva Amarnath
Aporva Amarnath
SFSiying Feng
Siying Feng
RDRonald Dreslinski
Ronald Dreslinski
Sparse matrices are widely used in graph and data analytics, machine learning, engineering and scientific applications. This paper describes and analyzes OuterSPACE, an accelerator targeted at applications that involve large sparse matrices. OuterSPACE is a highly-scalable, energy-efficient, reconfigurable design, consisting of massively parallel Single Program, Multiple Data (SPMD)-style processing units, distributed memories, high-speed crossbars and High Bandwidth Memory (HBM). We identify redundant memory accesses to non-zeros as a key bottleneck in traditional sparse matrix-matrix multiplication algorithms. To ameliorate this, we implement an outer product based matrix multiplication technique that eliminates redundant accesses by decoupling multiplication from accumulation. We demonstrate that traditional architectures, due to limitations in their memory hierarchies and ability to harness parallelism in the algorithm, are unable to take advantage of this reduction without incurring significant overheads. OuterSPACE is designed to specifically overcome these challenges. We simulate the key components of our architecture using gem5 on a diverse set of matrices from the University of Florida's SuiteSparse collection and the Stanford Network Analysis Project and show a mean speedup of 7.9× over Intel Math Kernel Library on a Xeon CPU, 13.0× against cuSPARSE and 14.0× against CUSP when run on an NVIDIA K40 GPU, while achieving an average throughput of 2.9 GFLOPS within a 24 W power budget in an area of 87 mm 2 .

2 June 2021 in IEEE Computer Architecture Letters
Verified
Journal Article
Closed access
AAAporva Amarnath
Aporva Amarnath
SPSubhankar Pal
Subhankar Pal
HKHiwot Tadese Kassa
Hiwot Tadese Kassa
AVAugusto Vega
Augusto Vega
ABAlper Buyuktosunoglu
Alper Buyuktosunoglu
PBPradip Bose
Pradip Bose
Fully autonomous vehicles (AVs) must meet stringent real-time performance and safety-criticality constraints of multiple applications simultaneously in highly dynamic environmental conditions. To enable such a system, carefully selected accelerators and general-purpose cores on Systems-on-Chips (SoCs) are required. However, schedulers that are agnostic to this heterogeneity lead to inefficient utilization of hardware resources and increase the time to complete the AV's mission. As a solution, our letter proposes a heterogeneity-aware, multi-level scheduler called HetSched. HetSched leverages run-time information about the underlying heterogeneous SoC, along with the applications’ real-time constraints to improve an AV's mission time. Our evaluation demonstrates a reduction in mission time of 2.0-4.8×, when compared against state-of-the-art (SOTA) schedulers. Furthermore, when used as part of an SoC design space exploration loop, in comparison to the SOTA schedulers, HetSched reduces the number of accelerators required by an SoC to safely complete the AV's mission by 1.9× on average.

1 January 2020 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Open access
DPDong-Hyeon Park
Dong-Hyeon Park
SPSubhankar Pal
Subhankar Pal
SFSiying Feng
Siying Feng
PGPaul Gao
Paul Gao
JTJielun Tan
Jielun Tan
RDRonald G. Dreslinski
Ronald G. Dreslinski
A sparse matrix-matrix multiplication (SpMM) accelerator with 48 heterogeneous cores and a reconfigurable memory hierarchy is fabricated in 40-nm CMOS. The compute fabric consists of dedicated floating-point multiplication units, and general-purpose Arm Cortex-M0 and Cortex-M4 cores. The on-chip memory reconfigures scratchpad or cache, depending on the phase of the algorithm. The memory and compute units are interconnected with synthesizable coalescing crossbars for efficient memory access. The 2.0-mm x 2.6-mm chip exhibits 12.6x (8.4x) energy efficiency gain, 11.7x (77.6x) off-chip bandwidth efficiency gain, and 17.1x (36.9x) compute density gains against a high-end CPU (GPU) across a diverse set of synthetic and real-world power-law graph-based sparse matrices.

31 January 2022 in IEEE Journal of Solid-State Circuits
Verified
Journal Article
Closed access
SKSung Kim
Sung Kim
MFMorteza Fayazi
Morteza Fayazi
ADAlhad Daftardar
Alhad Daftardar
KCKuan-Yu Chen
Kuan-Yu Chen
JTJielun Tan
Jielun Tan
HKHun-Seok Kim
Hun-Seok Kim
We present Versa, an energy-efficient 36-core systolic multiprocessor with dynamically reconfigurable interconnects and memory. Versa leverages reconfigurable functional units and systolic-enhanced ARM cores to adapt for different algorithm characteristics, providing optimized bandwidth, access latency, and data reuse. Hardware support for crucial thread-synchronization operations enables a tree-based algorithm with 6.5 $\times $ improvement in synchronization latency. Measured on a diverse set of compute kernels, Versa’s design features culminate in median energy-efficiency improvements of 37.2 $\times $ and 11.6 $\times $ over mobile CPU and GPU baselines, respectively.

1 March 2019
Verified
Conference Paper
Closed access
SFSiying Feng
Siying Feng
SPSubhankar Pal
Subhankar Pal
YYYichen Yang
Yichen Yang
RDRonald G. Dreslinski
Ronald G. Dreslinski
Improvements in clock speed and exploitation of Instruction-Level Parallelism (ILP) hit a roadblock during mid-2000s. This, coupled with the demise of Dennard scaling, led to the rise of multi-core machines. Today, multi-core processors are ubiquitous and architects have moved to specialization to work around the walls hit by single-core performance and chip Thermal Design Power (TDP). The pressure of innovation in the aftermath of Dennard scaling is shifting to software developers, who are required to write programs that make the most effective use of underlying hardware. This work presents quantitative and qualitative analyses of how software has evolved to reap the benefits of multi-core and heterogeneous computers, compared to state-of-the-art systems in 2000 and 2010. We study a wide spectrum of commonly-used applications on a state-of-the-art desktop machine and analyze two important metrics, Thread-Level Parallelism (TLP) and GPU utilization. We compare the results to prior work over the last two decades, which state that 2-3 CPU cores are sufficient for most applications and that the GPU is usually under-utilized. Our analyses show that the harnessed parallelism has improved and emerging workloads show good utilization of hardware resources. The average TLP across the applications we study is 3.1, with most applications attaining the maximum instantaneous TLP of 12 during execution. The GPU is over-provisioned for most applications, but workloads such as cryptocurrency mining utilize it to the fullest. Overall, we conclude that the effectiveness of software in utilizing the underlying hardware has improved, but still has scope for optimizations.

1 December 2014
Verified
Conference Paper
Closed access
PDF file
SPSubhankar Pal
Subhankar Pal
CVChetan Vudadha
Chetan Vudadha
PPP. Sai Phaneendra
P. Sai Phaneendra
SVSreehari Veeramachaneni
Sreehari Veeramachaneni
SMSrinivas Mandalika
Srinivas Mandalika
With the advent of nanotechnology, transistors are getting smaller and growing in number according to Moore's Law. With this, the issue of heat dissipation is becoming of greater concern to researchers as the transistor heat dissipation reaches the Land Auer limit. Reversible logic is predicted to be an alternative to conventional computing due to lesser energy dissipation and exponentially faster problem-solving capacity. This paper introduces the design of a reversible ripple-carry adder using a mix of the well-known NCV library and the recently introduced NCV-|v1 library, with the assumption of a four-level quantum system. The results for the proposed adder are compared with previous ripple-carry adder designs. It then explores the design of a cost-optimized reversible ALU by modifying the above adder. Finally, a comparison of the proposed ALU is made with one of the latest reversible ALU designs.