Many EDA applications are extremely sparse, irregular, and control-flow intensive.
Parallelizing this type of application can benefit from the ability to express dynamic task …

Graph partitioning is essential for understanding the structure of a dataset, such as social
networks and web pages. Among various graph partitioners, stochastic block partitioning …

Quantum circuit simulator (QCS) is essential for designing quantum algorithms because it
assists researchers in understanding how quantum operations work without access to …

Many circuit analysis workloads incorporate complex execution logic under dynamic control
flow, such as branch-and-bound techniques, on-the-fly pruning and recursive decomposition …

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 …

Dynamic task graph scheduling (DTGS) has become a powerful tool for parallel and
heterogeneous applications, such as static timing analysis and large-scale machine …

The pipeline is a fundamental pattern to parallelize a series of stage tasks over a sequence
of data in loops. Mainstream pipeline programming frameworks count on data abstractions …

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 …

Computer-aided design (CAD) tools typically incorporate thousands or millions of functional
tasks and dependencies to implement various synthesis and analysis algorithms. Efficiently …

Abstract Critical Path Generation (CPG) is fundamental for many static timing analysis (STA)
applications. As the circuit complexity continues to increase, CPG runtime has quickly …