Dian-Lun Lin

Dian-Lun Lin

Auto-generated profile, based on publicly available information

Dian-Lun Lin

The University of Wisconsin at Madison, Madison, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
21 May 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
THTsung-Wei Huang
Tsung-Wei Huang
DLDian-Lun Lin
Dian-Lun Lin
YLYibo Lin
Yibo Lin
CLChun-Xun Lin
Chun-Xun Lin
Taskflow tackles the long-standing question: How can we make it easier for developers to program parallel and heterogeneous computer-aided design (CAD) applications with high performance and simultaneous high productivity? Taskflow introduces a new powerful task graph programming model to assist developers in the implementation of parallel and heterogeneous algorithms with complex control flow. We develop an efficient system runtime to solve many of the new scheduling challenges arising out of our models and optimize the performance across latency, energy efficiency, and throughput. Taskflow has demonstrated promising performance on both micro-benchmarks and real-world applications. As an example, Taskflow solved a large-scale circuit placement problem up to 17% faster, with $1.3\times $ fewer memory, $2.1\times $ less power consumption, and $2.9\times $ higher throughput than two industrial-strength systems, oneTBB and StarPU, on a machine of 40 CPUs and 4 GPUs.

23 June 2024
Verified
Conference Paper
Open access
WLWan Luan Lee
Wan Luan Lee
DLDian-Lun Lin
Dian-Lun Lin
THTsung-Wei Huang
Tsung-Wei Huang
SJShui Jiang
Shui Jiang
THTsung-Yi Ho
Tsung-Yi Ho
BYBei Yu
Bei Yu

20 January 2025
Verified
Conference Paper
Open access
WLWan Luan Lee
Wan Luan Lee
DLDian-Lun Lin
Dian-Lun Lin
CCCheng-Hsiang Chiu
Cheng-Hsiang Chiu
USUlf Schlichtmann
Ulf Schlichtmann
THTsung-Wei Huang
Tsung-Wei Huang
Hypergraph partitioning plays a critical role in computer-aided design (CAD) because it allows us to break down a large circuit into several manageable pieces that facilitate efficient CAD algorithm designs. However, as circuit designs continue to grow in size, hypergraph partitioning becomes increasingly time-consuming. Recent research has introduced parallel hypergraph partitioners using multi-core CPUs to reduce the long runtime. However, the speedup of existing CPU parallel hypergraph partitioners is typically limited to a few cores. To overcome these challenges, we propose HyperG, a GPU-accelerated multilevel k-way hypergraph partitioning algorithm. HyperG introduces an innovative balanced group coarsening and a sequence-based refinement algorithm to accelerate both the coarsening and uncoarsening stages. Experimental results show that HyperG outperforms both the state-of-the-art sequential and CPU-based parallel partitioners with an average speedup of 133× and 4.1× while achieving comparable partitioning quality.

1 May 2023
Verified
Conference Paper
Closed access
EDElmir Dzaka
Elmir Dzaka
DLDian-Lun Lin
Dian-Lun Lin
THTsung-Wei Huang
Tsung-Wei Huang
Acquiring significant speedup in gate-level simulation has proven challenging due to limitations such as synchronization and partition overhead. As a result, serial event-driven simulation remains the industry standard despite its slow runtime performance. This paper presents the utilization of Taskflow, a task-graph computing system, to effectively enhance the speedup of gate-level simulation. Taskflow provides solutions to challenges faced in previous attempts at parallelizing gate-level simulation, such as scalable pipelines, conditional tasking, and heterogeneous work stealing. The focus of the paper is on improving speedup within and-inverter graphs, which are used to represent structural implementations of circuits at the gate-level. Experimental results demonstrate significant speedup within and-inverter graph benchmarks.

12 March 2024
Verified
Conference Paper
Open access
THTsung-Wei Huang
Tsung-Wei Huang
BZBoyang Zhang
Boyang Zhang
DLDian-Lun Lin
Dian-Lun Lin
CCCheng-Hsiang Chiu
Cheng-Hsiang Chiu
Static timing analysis (STA) is an integral part in the overall design flow because it verifies the expected timing behaviors of a circuit. However, as the circuit complexity continues to enlarge, there is an increasing need for enhancing the performance of existing STA algorithms using emerging heterogeneous parallelism that comprises manycore central processing units (CPUs) and graphics processing units (GPUs). In this paper, we introduce several state-of-the-art STA techniques, including task-based parallelism, task graph partition, and GPU kernel algorithms, all of which have brought significant performance benefits to STA applications. Motivated by these successful results, we will introduce a task-parallel programming system to generalize our solutions to benefit broader scientific computing applications.

23 June 2024
Verified
Conference Paper
Open access
BZBoyang Zhang
Boyang Zhang
DLDian-Lun Lin
Dian-Lun Lin
CCChe Chang
Che Chang
CCCheng-Hsiang Chiu
Cheng-Hsiang Chiu
BWBojue Wang
Bojue Wang
THTsung-Wei Huang
Tsung-Wei Huang