3 citations · 4 across the 8 of their papers we have counts for
9 papers
Agent.xpu: Efficient Scheduling of Agentic LLM Workloads on Heterogeneous SoC
Xinming Wei, Jiahao Zhang, Haoran Li +6
Personal LLM agents increasingly combine foreground reactive interactions with background proactive monitoring, forming long-lived, stateful LLM flows that interleave prefill and t…
Floorplanning with I/O assignment via feasibility-seeking and superiorization methods
Shan Yu, Yair Censor, Guojie Luo
The feasibility-seeking approach offers a systematic framework for managing and resolving intricate constraints in continuous problems, making it a promising avenue to explore in t…
MEC: An Open-source Fine-grained Mapping Equivalence Checking Tool for FPGA
Liwei Ni, Zonglin Yang, Jiaxi Zhang +6
Technology mapping is an essential step in EDA flow. However, the function of the circuit may be changed after technology mapping, and equivalence checking (EC) based verification…
Fast Exact NPN Classification with Influence-aided Canonical Form
Yonghe Zhang, Liwei Ni, Jiaxi Zhang +3
NPN classification has many applications in the synthesis and verification of digital circuits. The canonical-form-based method is the most common approach, designing a canonical f…
OpenPARF: An Open-Source Placement and Routing Framework for Large-Scale Heterogeneous FPGAs with Deep Learning Toolkit
Jing Mai, Jiarui Wang, Zhixiong Di +3
This paper proposes OpenPARF, an open-source placement and routing framework for large-scale FPGA designs. OpenPARF is implemented with the deep learning toolkit PyTorch and suppor…
Per-RMAP: Feasibility-Seeking and Superiorization Methods for Floorplanning with I/O Assignment
Shan Yu, Yair Censor, Ming Jiang +1
The feasibility-seeking approach provides a systematic scheme to manage and solve complex constraints for continuous problems, and we explore it for the floorplanning problems with…
Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions
Jiaxi Zhang, Shenggen Zheng, Liwei Ni +2
NPN classification is an essential problem in the design and verification of digital circuits. Most existing works explored variable symmetries and cofactor signatures to develop t…
Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning
Jiaxi Zhang, Liwei Ni, Shenggen Zheng +4
Boolean matching is significant to digital integrated circuits design. An exhaustive method for Boolean matching is computationally expensive even for functions with only a few var…
BlockGNN: Towards Efficient GNN Acceleration Using Block-Circulant Weight Matrices
Zhe Zhou, Bizhao Shi, Zhe Zhang +3
In recent years, Graph Neural Networks (GNNs) appear to be state-of-the-art algorithms for analyzing non-euclidean graph data. By applying deep-learning to extract high-level repre…