Rasit Onur Topaloglu

Dr. Rasit Onur Topaloglu

orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
18 October 2021
Verified
Conference Paper
Open access
ASAakarshitha Suresh
Aakarshitha Suresh
ASAbdullah Ash Saki
Abdullah Ash Saki
MAMahababul Alam
Mahababul Alam
RTRasit Onur Topaloglu
Rasit Onur Topaloglu
SGSwaroop Ghosh
Swaroop Ghosh
In the Noisy Intermediate-Scale Quantum (NISQ) realm, efficient quantum circuit compilation is critical to ensure successful computation. Several third-party compilers are improving the compilation times and depth/gate counts. Untrusted third parties or a particular version of a trusted compiler may allow an attacker to steal, clone, and/or reverse engineer the quantum circuit. We propose to obfuscate quantum circuits by employing dummy CNOT gates to prevent such threats. If the adversary clones the obfuscated design, he/she will get faulty results. We propose a metric-based dummy gate insertion process to ensure maximum corruption of functionality measured using Total Variation Distance (TVD) and validated using IBM’s noisy simulators. Our metric guided dummy gate insertion process achieves TVD of up to 28.83%, and performs 10.14% better than the average TVD and performs within 12.45% of the best obtainable TVD for the test benchmarks. The removal of dummy gates by the designer post-compilation to restore functionality as well as other finer details have been addressed.

5 June 2011
Verified
Conference Paper
Open access
PDF file
HZHongbo Zhang
Hongbo Zhang
YDYuelin Du
Yuelin Du
MWMartin D. F. Wong
Martin D. F. Wong
RTRasit Onur Topaloglu
Rasit Onur Topaloglu
Self-aligned double patterning (SADP) lithography is a promising technology which can reduce the overlay and print 2D features for sub-32nm process. Yet, how to decompose a layout to minimize the overlay and perform hot spot detection is still an open problem. In this paper, we present an algorithm that can optimally solve the SADP decomposition problem. For a decomposable layout, our algorithm guarantees to find a decomposition solution that minimizes overlay. For a non-decomposable layout our algorithm guarantees to find all hot spots. Experimental results validate our method, and decomposition results for Nangate Open Cell Library and larger testcases are also provided with competitive runtimes.

17 June 2008 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
AKAndrew B. Kahng
Andrew B. Kahng
PSPuneet Sharma
Puneet Sharma
RTRasit Onur Topaloglu
Rasit Onur Topaloglu
Starting at the 65-nm node, stress engineering to improve the performance of transistors has been a major industry focus. An intrinsic stress source-shallow trench isolation (STI)-has not been fully utilized up to now for circuit performance improvement. In this paper, we present a new methodology that combines detailed placement and active-layer fill insertion to exploit STI stress for performance improvement. We conduct process simulation of a 65-nm production STI technology to generate mobility and delay impact models for STI stress. We then utilize these models to perform STI-stress-aware delay analysis of critical paths using Simulation Program with Integrated Circuit Emphasis (SPICE). We present our timing-driven optimization of STI stress in standard cell designs, using detailed placement perturbation and active-layer fill insertion to improve complementary metal-oxide-semiconductor performance. We assess the proposed analysis and optimization on small designs implemented with a 65-nm production cell library and a standard synthesis place-and-route flow. Our stress-aware timing analysis improves the clock frequency by 4.68% to 6.31% over traditional worst case analysis, and our optimization improves clock frequency by 2.44% to 5.26%. The frequency improvement through exploitation of STI stress comes at practically zero cost in terms of design area and wire length.

1 February 2021
Verified
Conference Paper
Open access
SRShubham Rai
Shubham Rai
WNWalter Lau Neto
Walter Lau Neto
YMYukio Miyasaka
Yukio Miyasaka
XZXinpei Zhang
Xinpei Zhang
MYMingfei Yu
Mingfei Yu
SCSatrajit Chatterjee
Satrajit Chatterjee
Logic synthesis is a fundamental step in hardware design whose goal is to find structural representations of Boolean functions while minimizing delay and area. If the function is completely-specified, the implementation accurately represents the function. If the function is incompletely-specified, the implementation has to be true only on the care set. While most of the algorithms in logic synthesis rely on SAT and Boolean methods to exactly implement the care set, we investigate learning in logic synthesis, attempting to trade exactness for generalization. This work is directly related to machine learning where the care set is the training set and the implementation is expected to generalize on a validation set. We present learning incompletely-specified functions based on the results of a competition conducted at IWLS 2020. The goal of the competition was to implement 100 functions given by a set of care minterms for training, while testing the implementation using a set of validation minterms sampled from the same function. We make this benchmark suite available and offer a detailed comparative analysis of the different approaches to learning.

9 September 2023 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
HSHarsh Sharma
Harsh Sharma
LPLukas Pfromm
Lukas Pfromm
RTRasit Onur Topaloglu
Rasit Onur Topaloglu
JDJanardhan Rao Doppa
Janardhan Rao Doppa
UOUmit Ogras
Umit Ogras
PPPartha Pratim Pande
Partha Pratim Pande
Recent advances in 2.5D chiplet platforms provide a new avenue for compact scale-out implementations of emerging compute- and data-intensive applications including machine learning. Network-on-Interposer (NoI) enables integration of multiple chiplets on a 2.5D system. While these manycore platforms can deliver high computational throughput and energy efficiency by running multiple specialized tasks concurrently, conventional NoI architectures have a limited computational throughput due to their inherent multi-hop topologies. In this paper, we propose Floret, a novel NoI architecture based on space-filling curves (SFCs). The Floret architecture leverages suitable task mapping, exploits the data flow pattern, and optimizes the inter-chiplet data exchange to extract high performance for multiple types of convolutional neural network (CNN) inference tasks running concurrently. We demonstrate that the Floret architecture reduces the latency and energy up to 58% and 64%, respectively, compared to state-of-the-art NoI architectures while executing datacenter-scale workloads involving multiple CNN tasks simultaneously. Floret achieves high performance and significant energy savings with much lower fabrication cost by exploiting the data-flow awareness of the CNN inference tasks.

1 January 2012
Verified
Conference Paper
Closed access
DKDae Hyun Kim
Dae Hyun Kim
RTRasit Onur Topaloglu
Rasit Onur Topaloglu
SLSung Kyu Lim
Sung Kyu Lim
Since re-designing and re-optimizing existing logic, memory, and IP blocks in a 3D fashion significantly increases design cost, near-term three-dimensional integrated circuit (3D IC) design will focus on reusing existing 2D blocks. One way to reuse 2D blocks in the 3D IC design is to first perform 3D floorplanning, insert signal through-silicon vias (TSVs) for 3D inter-block connections, and then route the blocks. In this paper, we propose algorithms (finding signal TSV locations, assigning TSVs to whitespace blocks, and manipulating whitespace blocks) for post-floorplanning signal TSV planning in the block-level 3D IC design. Experimental results show that our signal TSV planner outperforms the state-of-the-art TSV-aware 3D floorplanner by 7% to 38% with respect to wirelength. In addition, our multiple TSV insertion algorithm outperforms a single TSV insertion algorithm by 27% to 37%.