Rachel Selina Rajarathnam

Rachel Selina Rajarathnam

Auto-generated profile, based on publicly available information

Rachel Selina Rajarathnam

The University of Texas at Austin

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
17 January 2022
Verified
Conference Paper
Closed access
RRRachel Selina Rajarathnam
Rachel Selina Rajarathnam
MAMohamed Baker Alawieh
Mohamed Baker Alawieh
ZJZixuan Jiang
Zixuan Jiang
MIMahesh Iyer
Mahesh Iyer
DPDavid Z. Pan
David Z. Pan
Modern Field Programmable Gate Arrays (FPGAs) are large-scale heterogeneous programmable devices that enable high performance and energy efficiency. Placement is a crucial and computationally intensive step in the FPGA design flow that determines the physical locations of various heterogeneous instances in the design. Several works have employed GPUs and FPGAs to accelerate FPGA placement and have obtained significant runtime improvement. However, with these approaches, it is a non-trivial effort to develop optimized and algorithmic-specific kernels for GPU and FPGA to realize the best acceleration performance. In this work, we present DREAMPlaceFPGA, an open-source deep-learning toolkit-based accelerated placement framework for large-scale heterogeneous FPGAs. Notably, we develop new operators in our framework to handle heterogeneous resources and FPGA architecture-specific legality constraints. The proposed framework requires low development cost and provides an extensible framework to employ different placement optimizations. Our experimental results on the ISPD'2016 benchmarks show very promising results compared to prior approaches.

26 March 2023
Verified
Conference Paper
Open access
RRRachel Selina Rajarathnam
Rachel Selina Rajarathnam
ZJZixuan Jiang
Zixuan Jiang
MIMahesh A. Iyer
Mahesh A. Iyer
DPDavid Z. Pan
David Z. Pan
Placement plays a pivotal and strategic role in the FPGA implementation flow to allocate the physical locations of the heterogeneous instances in the design. Among the placement stages, the packing or clustering stage groups logic instances like look-up tables (LUTs) and flip-flops (FFs) that could be placed on the same site. The legalization stage determines all instances' physical site locations. With advances in FPGA architecture and technology nodes, designs contain millions of logic instances, and placement algorithms must scale accordingly. While other placement stages - global placement and detailed placement, have been accelerated using GPUs, the acceleration of packing and legalization stages on a GPU remains largely unexplored. This work presents DREAMPlaceFPGA-PL, an open-source packer-legalizer for heterogeneous FPGAs that employs GPU for acceleration. We revise the existing consensus-based parallel algorithms employed for packing and legalizing a flat placement to obtain further speedup on a GPU. Our experiments on the ISPD'2016 benchmarks demonstrate more than 2× acceleration.

18 March 2025 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
RZRuisi Zhang
Ruisi Zhang
RRRachel Selina Rajarathnam
Rachel Selina Rajarathnam
DPDavid Z. Pan
David Z. Pan
FKFarinaz Koushanfar
Farinaz Koushanfar
Physical design watermarking (WM) on contemporary integrated circuit (IC) layout encodes signatures without considering the dense connections and design constraints, which could lead to performance degradation on the watermarked products. This article presents ICMarks, a quality-preserving and robust WM framework for modern IC physical design. ICMarks embeds unique watermark signatures during the physical design’s placement stage, thereby authenticating the IC layout ownership. ICMarks’s novelty lies in 1) strategically identifying a region of cells to watermark with minimal impact on the layout performance and 2) a two-level WM framework for augmented robustness toward potential removal and forging attacks. Extensive evaluations on benchmarks of different design objectives and sizes validate that ICMarks incurs no wirelength and timing metrics degradation, while successfully proving ownership. Furthermore, we demonstrate ICMarks is robust against two major WM attack categories, namely, watermark removal and forging attacks; even if the adversaries have prior knowledge of the WM schemes, the signatures cannot be removed without significantly undermining the layout quality.

9 September 2024
Verified
Conference Paper
Open access
RZRuisi Zhang
Ruisi Zhang
RRRachel Selina Rajarathnam
Rachel Selina Rajarathnam
DPDavid Z. Pan
David Z. Pan
FKFarinaz Koushanfar
Farinaz Koushanfar
This paper presents AutoMarks, an automated and transferable watermarking framework that leverages graph neural networks to reduce the watermark search overheads during the placement stage. AutoMarks's novel automated watermark search is accomplished by (i) constructing novel graph and node features with physical, semantic, and design constraint-aware representation; (ii) designing a data-efficient sampling strategy for watermarking fidelity label collection; and (iii) leveraging a graph neural network to learn the connectivity between cells and predict the watermarking fidelity on unseen layouts. Extensive evaluations on ISPD'15 and ISPD'19 benchmarks demonstrate that our proposed automated methodology: (i) is capable of finding quality-preserving watermarks in a short time; and (ii) is transferable across various designs, i.e., AutoMarks trained on one layout is generalizable to other benchmark circuits. AutoMarks is also resilient against potential watermark removal and forging attacks.

12 June 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
RZRuisi Zhang
Ruisi Zhang
RRRachel Selina Rajarathnam
Rachel Selina Rajarathnam
DPDavid Pan
David Pan
FKFarinaz Koushanfar
Farinaz Koushanfar
Physical design refers to converting a logical circuit description into a physical chip layout for manufacturing. Although design companies invest huge efforts to fine-tune the cell positions and connections for better power, performance, and area metrics, chip layouts are vulnerable to security risks along the supply chain. Physical design watermarking injects signatures on the chip layout, allowing ownership authentication and avoiding potential security risks. A substantial effort is required to identify the best locations to insert the watermarks on the chip layout without affecting the overall layout quality. This article presents AutoMarks , an automated and transferable watermarking framework that leverages graph neural networks to reduce watermark search overhead during the integrated circuit design’s placement stage. AutoMarks ’s novel automated watermark search is accomplished by (i) constructing novel graph and node features with physical, semantic, and design constraint-aware representation; (ii) designing a data-efficient sampling strategy for watermarking fidelity label collection; and (iii) leveraging a graph neural network to learn the connectivity between cells and predict the watermarking fidelity on unseen layouts. Extensive evaluations on ISPD’15, ISPD’19, and ICCAD’15 benchmarks demonstrate that our proposed automated methodology: (i) is capable of finding quality-preserving watermarks in a short time; (ii) is transferable across various designs, i.e., AutoMarks trained on one layout is generalizable to other benchmark circuits; (iii) is effective in watermarking designs optimized for wirelength and timing metrics. AutoMarks is also resilient against potential watermark removal and forging attacks. Our code is publicly available on GitHub. 1

15 June 2026 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
ZXZhili Xiong
Zhili Xiong
ZLZhishang Luo
Zhishang Luo
RRRachel Rajarathnam
Rachel Rajarathnam
YWYusu Wang
Yusu Wang
DPDavid Pan
David Pan
Recent approaches to congestion prediction and routability-driven placement have made progress, yet important limitations remain. Most existing models rely on heuristic-based intermediate features (e.g., RUDY, pin density) rather than fully end-to-end learning, and many capture either netlist topology or geometric placement context, but not both, limiting their performance. Moreover, when model gradients are used to guide placers, they are often propagated through such intermediate features, reducing their accuracy and effectiveness. To address these gaps, we propose TopoGeoNet , a heterogeneous neural network that unifies graph-based message passing with convolutional U-Net processing over spatial grids. Through bi-directional node–grid communication, TopoGeoNet jointly leverages netlist topology and geometric placement information for accurate congestion prediction. Trained on ISPD’2016 FPGA benchmarks, TopoGeoNet achieves an 8.3% improvement in prediction accuracy over state-of-the-art ML baselines. When integrated into a routability-driven FPGA placer, it improves congestion scores by 16% on average and reduces total place-and-route runtime by 5% without degrading routed wirelength. Compared with state-of-the-art ML prediction models that provide inference and gradients through intermediate features, TopoGeoNet delivers superior routability results, highlighting the advantages of fully end-to-end prediction and differentiability.