Khyati Kiyawat

Khyati Kiyawat

Auto-generated profile, based on publicly available information

Khyati Kiyawat

Dept of Computer Science, University of Virginia

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
26 June 2023 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
AVAnu Verma
Anu Verma
KKKhyati Kiyawat
Khyati Kiyawat
BDBishnu Prasad Das
Bishnu Prasad Das
PMPramod Meher
Pramod Meher
Hyperbolic trigonometric functions are widely used in several engineering and scientific applications, including digital signal processing (DSP), communication systems, and many others. In this article, we propose a scaling-free hyperbolic coordinate rotation digital computer (CORDIC) algorithm and its architecture based on a novel power-of-2 coefficient low-complexity Taylor series approximation to implement $\sinh$ and $\cosh$ functions. CORDIC architectures are generally slow due to their high latency of computation. The proposed architecture reduces the latency and achieves the desired precision with only four iterations where an optimized angle set comprised of six CORDIC microrotations are mapped into a four-stage folded-pipeline structure leveraging mutually exclusive behavior of two pairs of microrotations. The proposed design is implemented on field-programmable gate arrays (FPGAs) Xilinx Zedboard using 65.38% less registers with $\sim$ 63.63% less latency and 48.97% less power consumption compared with the best of the existing designs. The proposed design is synthesized by Synopsys Design Compiler and place and route (PnR) tool using Taiwan Semiconductor Manufacturing Company (TSMC) 65-nm CMOS process. It consumes $\sim$ 76.31% less area, 68.75% less computational delay, and 68.92% less power consumption compared with the best of the existing designs. Moreover, the proposed architecture involves 46.89% less energy per output (EPO) than the best of the existing designs. The error–energy performance (EEP) and the error–area performance (EAP) of the proposed design are, respectively, $\sim$ 1.25 times and $\sim$ 2.8 times better than that of the best of the existing designs. Besides, the proposed architecture is also implemented and verified on a silicon chip in the TSMC 180-nm CMOS process for the validation of the algorithm and architecture.

23 March 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
ASAkhil Shekar
Akhil Shekar
KGKevin Gaffney
Kevin Gaffney
MPMartin Prammer
Martin Prammer
KKKhyati Kiyawat
Khyati Kiyawat
LWLingxi Wu
Lingxi Wu
KSKevin Skadron
Kevin Skadron
In-memory database query processing frequently involves substantial data transfers between the CPU and memory, leading to inefficiencies due to the Von Neumann bottleneck. Processing-in-Memory (PIM) architectures offer a viable solution to alleviate this bottleneck. In our study, we employ a commonly used software approach that streamlines JOIN operations into simpler selection or filtering tasks via pre-join denormalization, thereby making the query processing workload more amenable to PIM acceleration. This research explores the DRAM design landscape to evaluate how effectively these filtering tasks can be executed efficiently across the DRAM hierarchy and their effect on overall application speedup. We also find that operations such as aggregates are better executed on the CPU than on PIM. Thus, we propose a cooperative query processing framework that capitalizes on both CPU and PIM strengths, where (i) the DRAM-based PIM block, with its massive parallelism, supports scan operations while (ii) CPU, with its flexible architecture, supports the rest of the query execution. This allows us to utilize both PIM and CPU where appropriate and prevent dramatic changes to the overall system architecture. With these minor modifications to the system architecture and a customized version of the DuckDB database to integrate offloaded scan operations into the CPU-side processing, our methodology enables accurate end-to-end performance evaluations using established analytical benchmarks such as TPC-H and the Star Schema Benchmark (SSB). Our findings show that this novel mapping approach improves performance, delivering a \(5.92x/6.5x\) speedup (TPCH/SSB) compared to a traditional schema and \(3.03-4.05x\) speedup compared to a denormalized schema with \(9-17\%\) memory overhead, depending on the degree of partial denormalization. Further, we provide insights into query selectivity, memory overheads, and software optimizations in the context of PIM-based filtering, which better explain the behavior and performance of these systems across the benchmarks.

6 October 2025
Verified
Conference Paper
Open access
MBMorteza Baradaran
Morteza Baradaran
KKKhyati Kiyawat
Khyati Kiyawat
ASAkhil Shekar
Akhil Shekar
AMAbdullah T. Mughrabi
Abdullah T. Mughrabi
KSKevin Skadron
Kevin Skadron