Ting-Ru Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ting-Ru Lin has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Massoud Pedram
University of Southern California, USA
4 shared publications - Bo Zhang
Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA, USA
1 shared publication - Lizhong Chen
Oregon State University Oregon State University
1 shared publication Tim Edwards
1 shared publication- Yunfan Li
Corvallis, Oregon United States
1 shared publication
Latest Publications
- 29 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Applied Superconductivity
- Vol. 30 (7) , 1-14
Postrouting Optimization of the Working Clock Frequency of Single-Flux-Quantum Circuits
With the emergence of large-scale single-flux-quantum (SFQ) circuits, it is highly expected to offload heavy routing tasks to electronic design automation (EDA) tools. The unique characteristic of SFQ circuits is that large clock distribution topologies are generally required to pass clock signals to clocked cells with a fanout limitation for signal evaluation and state transition. The large clock distribution topologies and the fanout limitation pose a great challenge to control clock skew and path delays of an SFQ circuit during the routing step. The values of clock skew and path delays determine not only maximum working frequencies but also hold time violations. However, it is not necessary to develop a timing-driven routing tool specifically for SFQ circuits from scratch because the number of the paths related to frequencies and hold time violations is generally very small. Thus, we present a novel post-routing optimization framework which complements routing tools through reducing path lengths for working frequencies and meandering paths for hold time violations. A framework is developed in which machine learning is applied to analyze wire distributions and then a maze routing algorithm is performed to re-route targeted paths. Based on the MIT-LL SFQ5ee process technology, we demonstrate that the our framework can improve the maximum working frequency by 7% on average over the state-of-the-art EDA routing tool for 14 SFQ circuits while fixing all hold time violations in 180 seconds.
- 29 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Applied Superconductivity
- Vol. 30 (7) , 1-14
Postrouting Optimization of the Working Clock Frequency of Single-Flux-Quantum Circuits
With the emergence of large-scale single-flux-quantum (SFQ) circuits, it is highly expected to offload heavy routing tasks to electronic design automation (EDA) tools. The unique characteristic of SFQ circuits is that large clock distribution topologies are generally required to pass clock signals to clocked cells with a fanout limitation for signal evaluation and state transition. The large clock distribution topologies and the fanout limitation pose a great challenge to control clock skew and path delays of an SFQ circuit during the routing step. The values of clock skew and path delays determine not only maximum working frequencies but also hold time violations. However, it is not necessary to develop a timing-driven routing tool specifically for SFQ circuits from scratch because the number of the paths related to frequencies and hold time violations is generally very small. Thus, we present a novel post-routing optimization framework which complements routing tools through reducing path lengths for working frequencies and meandering paths for hold time violations. A framework is developed in which machine learning is applied to analyze wire distributions and then a maze routing algorithm is performed to re-route targeted paths. Based on the MIT-LL SFQ5ee process technology, we demonstrate that the our framework can improve the maximum working frequency by 7% on average over the state-of-the-art EDA routing tool for 14 SFQ circuits while fixing all hold time violations in 180 seconds.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Reducing the Maximum Length of Connections in Single Flux Quantum Circuits During Routing
As the number of nets connecting single-flux-quantum (SFQ) cells in large-scale SFQ circuits grows, powerful electronic design automation (EDA) tools are needed to mitigate the wire routing task. Moreover, the clock frequency of SFQ circuits is heavily influenced by the longest wire delay. However, current routing tools have no means to control the maximum length of routing wires. In this paper, we present an innovative post-routing optimization framework which reduces the maximum wirelength in SFQ circuits. A framework is developed in which the longest wire is ripped and re-routed by resorting to a maze routing algorithm after the acquisition of wire density distribution using a machine learning method. Based on the MIT-LL SFQ5ee process technology and using a small library of SFQ logic cells, we show that the proposed framework can complete post-routing optimization of 13 SFQ circuits in 8 minutes while reducing the length of the longest wire by 11.8% on average over the state-of-the-art EDA routing tool for large-scale SFQ circuits.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Reducing the Maximum Length of Connections in Single Flux Quantum Circuits During Routing
As the number of nets connecting single-flux-quantum (SFQ) cells in large-scale SFQ circuits grows, powerful electronic design automation (EDA) tools are needed to mitigate the wire routing task. Moreover, the clock frequency of SFQ circuits is heavily influenced by the longest wire delay. However, current routing tools have no means to control the maximum length of routing wires. In this paper, we present an innovative post-routing optimization framework which reduces the maximum wirelength in SFQ circuits. A framework is developed in which the longest wire is ripped and re-routed by resorting to a maze routing algorithm after the acquisition of wire density distribution using a machine learning method. Based on the MIT-LL SFQ5ee process technology and using a small library of SFQ logic cells, we show that the proposed framework can complete post-routing optimization of 13 SFQ circuits in 8 minutes while reducing the length of the longest wire by 11.8% on average over the state-of-the-art EDA routing tool for large-scale SFQ circuits.
- 9 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Applied Superconductivity
- Vol. 29 (7) , 1-12
qGDR: A Via-Minimization-Oriented Routing Tool for Large-Scale Superconductive Single-Flux-Quantum Circuits
Single-flux-quantum (SFQ) circuit technologies are promising digital circuit technologies with high-speed and extremely low-power characteristics. However, heavy wire routing tasks are finished either by considerable human effort or by commercial routing tools with few physical considerations for the SFQ circuits. In this paper, we present an integrated global and detailed router for the SFQ circuits, qGDR, which aims at reducing impedance mismatch during signal transfer by minimizing total number of used vias. The global router allocates routing resources while minimizing the via usage by a dynamic layer assignment algorithm. The detailed router follows the global routing results to complete the routing task by resorting to a maze routing algorithm. Following the MIT-LL SFQ5ee process technology, qGDR can use only two routing layers to route an 8-bit integer divider with more than 40,000 Josephson junctions in less than one hour.
- 9 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Applied Superconductivity
- Vol. 29 (7) , 1-12
qGDR: A Via-Minimization-Oriented Routing Tool for Large-Scale Superconductive Single-Flux-Quantum Circuits
Single-flux-quantum (SFQ) circuit technologies are promising digital circuit technologies with high-speed and extremely low-power characteristics. However, heavy wire routing tasks are finished either by considerable human effort or by commercial routing tools with few physical considerations for the SFQ circuits. In this paper, we present an integrated global and detailed router for the SFQ circuits, qGDR, which aims at reducing impedance mismatch during signal transfer by minimizing total number of used vias. The global router allocates routing resources while minimizing the via usage by a dynamic layer assignment algorithm. The detailed router follows the global routing results to complete the routing task by resorting to a maze routing algorithm. Following the MIT-LL SFQ5ee process technology, qGDR can use only two routing layers to route an 8-bit integer divider with more than 40,000 Josephson junctions in less than one hour.
- 18 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 18 (1) , 51-54
Design Space Exploration of Memory Controller Placement in Throughput Processors with Deep Learning
As throughput-oriented processors incur a significant number of data accesses, the placement of memory controllers (MCs) has a critical impact on overall performance. However, due to the lack of a systematic way to explore the huge design space of MC placements, only a few ad-hoc placements have been proposed, leaving much of the opportunity unexploited. In this paper, we present a novel deep-learning based framework that explores this opportunity intelligently and automatically. The proposed framework employs a genetic algorithm to efficiently guide exploration through the large design space while utilizing deep learning methods to provide fast performance prediction of design points instead of relying on slow full system simulations. Evaluation shows that, the proposed deep learning models achieves a speedup of $282\times$ for the search process, and the MC placement found by our framework improves the average performance (IPC) of 18 benchmarks by 19.3% over the best-known placement found by human intuition.- 18 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 18 (1) , 51-54
Design Space Exploration of Memory Controller Placement in Throughput Processors with Deep Learning
As throughput-oriented processors incur a significant number of data accesses, the placement of memory controllers (MCs) has a critical impact on overall performance. However, due to the lack of a systematic way to explore the huge design space of MC placements, only a few ad-hoc placements have been proposed, leaving much of the opportunity unexploited. In this paper, we present a novel deep-learning based framework that explores this opportunity intelligently and automatically. The proposed framework employs a genetic algorithm to efficiently guide exploration through the large design space while utilizing deep learning methods to provide fast performance prediction of design points instead of relying on slow full system simulations. Evaluation shows that, the proposed deep learning models achieves a speedup of $282\times$ for the search process, and the MC placement found by our framework improves the average performance (IPC) of 18 benchmarks by 19.3% over the best-known placement found by human intuition.