Srivatsa Srinivasa

Srivatsa Srinivasa

Auto-generated profile, based on publicly available information

Srivatsa Srinivasa

Intel, Hillsboro, OR, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
16 January 2018 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Open access
SSSrivatsa Srinivasa
Srivatsa Srinivasa
Xueqing LiXueqing Li
Xueqing Li
MCMeng-Fan Chang
Meng-Fan Chang
JSJohn Sampson
John Sampson
SGSumeet Kumar Gupta
Sumeet Kumar Gupta
VNVijaykrishnan Narayanan
Vijaykrishnan Narayanan
This paper proposes the use of monolithic 3-D integration technology in designing a novel two-layer 3-D-static random access memory (3-D-SRAM) cell in standard 6T-SRAM footprint. The proposed 3-D-SRAM cell is capable of data access from both the layers. The cell is designed to retrieve row-wise and column-wise data concurrently from the memory array. This memory design can cater to applications and workloads requiring multidimensional data access for enhancing system performance. The novel 3-D layout technique ensures the same footprint as a 6T-SRAM cell despite enhancing the functionality. The design ensures no degradation in the cell stability and performance. Voltage reduction in layer-2 provides 5.4× power savings during column-wise data access. We analyze the implications of employing the proposed SRAM to achieve efficient data access for integral image algorithm. We obtain 2.15× savings in access time and 7.81% access energy savings while accessing data from a 32-kB memory array to compute integral image for a region of 32 rows and 16 columns.

1 January 2017
Verified
Conference Paper
Closed access
KMKaisheng Ma
Kaisheng Ma
XLXueqing Li
Xueqing Li
SSSrivatsa Rangachar Srinivasa
Srivatsa Rangachar Srinivasa
Yongpan LiuYongpan Liu
Yongpan Liu
JSJohn Sampson
John Sampson
VNVijaykrishnan Narayanan
Vijaykrishnan Narayanan
Batteryless energy harvesting systems face a twofold challenge in converting incoming energy into forward progress. Not only must such systems contend with inherently weak and fluctuating power sources, but they have very limited temporal windows for capitalizing on transitory periods of above-average power. To maximize forward progress, such systems should aggressively consume energy when it is available, rather than optimizing for peak averagecase efficiency. However, there are multiple ways that a processor can trade between consumption and performance. In this paper, we examine two approaches, frequency scaling and resource scaling, and develop a predictor-driven scheme for dynamically allocating future power budgets between the two techniques. We show that our solution can achieve forward progress equal to 2.08X of the baseline Out-of-Order (OoO) processor with the best static configuration of frequency and resources. The combined technique outperforms either technique in isolation, with frequency-only and resource-only approaches achieving 1.43X and 1.61X forward progress improvements, respectively.

23 February 2018 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
SGSumitha George
Sumitha George
Xueqing LiXueqing Li
Xueqing Li
MLMinli Julie Liao
Minli Julie Liao
KMKaisheng Ma
Kaisheng Ma
SSSrivatsa Srinivasa
Srivatsa Srinivasa
VNVijaykrishnan Narayanan
Vijaykrishnan Narayanan
In this paper, we propose a novel memory architecture with the capability of single-cycle row-wise/column-wise accesses. Such an architecture is highly suitable for workloads featuring spatial locality in multiple dimensions, which is a characteristic of many matrix and array operations. We describe in detail the circuit design techniques enabling the proposed architectures, as well as the viability of emerging memory technologies based on ferroelectric transistors (FEFETs) for our design. Compared to FEFET memory with standard 1-D access, we achieve 5% energy savings for the proposed memory featuring 2-D read and 93% energy savings for memory with 2-D read and write, for 32 bit column read and write. In addition, we get around 11% and 95% delay savings for 2-D read-enabled memory and 2-D read-write memory, respectively. The application analysis shows that 2-D read-enabled memory achieves around 86% average decrease in row-buffer transactions in $256x256$ size matrix operations without any array area increase. The 2-D read write memory offers 87% decrease in row-buffer transactions with 28.5% increase in array area compared to the 1-D FEFET memory.

1 January 2019 in Procedia Manufacturing
Verified
Journal Article
Open access
WZWenhui Zhang
Wenhui Zhang
YJYizheng Jiao
Yizheng Jiao
DWDazhong Wu
Dazhong Wu
SSSrivatsa Srinivasa
Srivatsa Srinivasa
ADAsmit De
Asmit De
PLPeng Liu
Peng Liu

1 July 2018
Verified
Conference Paper
Closed access
NJNicholas Jao
Nicholas Jao
ARAkshay Krishna Ramanathan
Akshay Krishna Ramanathan
SSSrivatsa Srinivasa
Srivatsa Srinivasa
SGSumitha George
Sumitha George
JSJohn Sampson
John Sampson
VNVijaykrishnan Narayanan
Vijaykrishnan Narayanan
Compute-in-Memory (CiM) techniques focus on reducing data movement by integrating compute elements within or near the memory primitives. While there have been decades of research on various aspects of such logic and memory integration, the confluence of new technology changes and emerging workloads makes us revisit this design space. This work focuses on new functionality that can be embedded to SRAMs using emerging monolithic 3D integration. Properties of the new technology transform the costs of embedding such new functionality compared to prior efforts. This work also explores how compute functionality can be embedded into cross-point style non-volatile memory systems.

29 June 2025
Verified
Conference Paper
Open access
SSSrivatsa Rangachar Srinivasa
Srivatsa Rangachar Srinivasa
DKDileep Kurian
Dileep Kurian
PAPaolo Aseron
Paolo Aseron
PBPrerna Budhkar
Prerna Budhkar
VHVinayak Honkote
Vinayak Honkote
TKTanay Karnik
Tanay Karnik