SearcharxivSearch

arXiv subjects

Wenxing Zhu

Publications and source records attributed to Wenxing Zhu.

10 recordsLinked to original sources

WarpagePINN: Thermal Warpage Prediction in Advanced Packaging via a Two-Stage Physics-Informed Neural Networks

Thermal warpage has become a critical issue in advanced packaging, primarily caused by the mismatch in coefficients of thermal expansion (CTE) among heterogeneously integrated materials. However, only a limited number of studies have focused on developing computational methods for coupled thermal-warpage prediction in the chiplet. This paper proposes a two-stage physics-informed neural network (WarpagePINN) framework to compute both temperature profile and warpage deformation of chiplets. The neural networks are trained without relying on labeled datasets generated by conventional simulators. In the first stage, the temperature field is modeled using a Fourier series representation that inherently satisfies boundary conditions, and the network is trained solely through a loss function derived from the governing equation. In the second stage, a multilayer perceptron (MLP) is employed for warpage prediction, utilizing a novel hybrid supervisory strategy to optimize the energy-based loss function instead of residual loss. A parametric WarpagePINN is also developed to quantify uncertainties associated with the CTE. Numerical results show that the proposed WarpagePINN framework achieves excellent agreement with conventional finite element methods, with a mean absolute error (MAE) of 0.2 μm, while achieving a speedup of approximately 1000 {\times} in CTE parameterization studies.

math.NA

ACE-Bench: A Lightweight Benchmark for Evaluating Azure SDK Usage Correctness

We present ACE-Bench (Azure SDK Coding Evaluation Benchmark), an execution-free benchmark that provides fast, reproducible pass or fail signals for whether large language model (LLM)-based coding agents use Azure SDKs correctly-without provisioning cloud resources or maintaining fragile end-to-end test environments. ACE-Bench turns official Azure SDK documentation examples into self-contained coding tasks and validates solutions with task-specific atomic criteria: deterministic regex checks that enforce required API usage patterns and reference-based LLM-judge checks that capture semantic workflow constraints. This design makes SDK-centric evaluation practical in day-to-day development and CI: it reduces evaluation cost, improves repeatability, and scales to new SDKs and languages as documentation evolves. Using a lightweight coding agent, we benchmark multiple state-of-the-art LLMs and quantify the benefit of retrieval in an MCP-enabled augmented setting, showing consistent gains from documentation access while highlighting substantial cross-model differences.

cs.DC

Poisson Energy Formulation for Floorplanning: Variational Analysis and Mathematical Foundations

Arranging many modules within a bounded domain without overlap, central to the Electronic Design Automation (EDA) of very large-scale integrated (VLSI) circuits, represents a broad class of discrete geometric optimization problems with physical constraints. This paper develops a variational and spectral framework for Poisson energy-based floorplanning and placement in physical design. We show that the Poisson energy, defined via a Neumann Poisson equation, is exactly the squared H^{-1} Sobolev norm of the density residual, providing a functional-analytic interpretation of the classical electrostatic analogy. Through spectral analysis, we demonstrate that the energy acts as an intrinsic low-pass filter, suppressing high-frequency fluctuations while enforcing large-scale uniformity. Under a mild low-frequency dominance assumption, we establish a quantitative linear lower bound relating the Poisson energy to the geometric overlap area, thereby justifying its use as a smooth surrogate for the hard nonoverlap constraint. We further show that projected gradient descent converges globally to stationary points and exhibits local linear convergence near regular minima. Finally, we interpret the continuous-time dynamics as a Wasserstein-2 gradient flow, revealing the intrinsic nonlocality and global balancing behavior of the model. These results provide a mathematically principled foundation for PDE-regularized optimization in large-scale floorplanning and related geometric layout problems.

cs.CE

Linear, decoupled, second-order and structure-preserving scheme for Carreau fluid equations coupled with steric Poisson-Nernst-Planck model

In this paper, to study ionic steric effects, we present a linear, decoupled, second-order accurate in time and structure-preserving scheme with finite element approximations for Carreau fluid equations coupled with steric Poisson-Nernst-Planck (SPNP) model. The logarithmic transformation for the ion concentration is used to preserve positivity property. To deal with the nonlinear coupling terms in fluid equation, a nonlocal auxiliary variable with respect to the free energy of SPNP equations and its associated ordinary differential equation are introduced. The obtained system is equivalent to the original system. The fully discrete scheme is proved to be mass conservative, positivity-preserving for ion concentration and energy dissipative at discrete level. Some numerical simulations are provided to demonstrate its stability and accuracy. Moreover, the ionic steric effects are numerically investigated.

math.NA

Linear, decoupled, positivity preserving, positive-definiteness preserving and energy stable schemes for the diffusive Oldroyd-B coupled with PNP model

In this paper, we present a first-order finite element scheme for the viscoelastic electrohydrodynamic model. The model incorporates the Poisson-Nernst-Planck equations to describe the transport of ions and the Oldroyd-B constitutive model to capture the behavior of viscoelastic fluids. To preserve the positive-definiteness of the conformation tensor and the positivity of ion concentrations, we employ both logarithmic transformations. The decoupled scheme is achieved by introducing a nonlocal auxiliary variable and using the splitting technique. The proposed schemes are rigorously proven to be mass conservative and energy stable at the fully discrete level. To validate the theoretical analysis, we present numerical examples that demonstrate the convergence rates and the robust performance of the schemes. The results confirm that the proposed methods accurately handle the high Weissenberg number problem (HWNP) at moderately high Weissenberg numbers. Finally, the flow structure influenced by the elastic effect within the electro-convection phenomena has been studied.

math.NA

iEDA: An Open-Source Intelligent Physical Implementation Toolkit and Library

Open-source EDA shows promising potential in unleashing EDA innovation and lowering the cost of chip design. This paper presents an open-source EDA project, iEDA, aiming for building a basic infrastructure for EDA technology evolution and closing the industrial-academic gap in the EDA area. iEDA now covers the whole flow of physical design (including Floorplan, Placement, CTS, Routing, Timing Optimization etc.), and part of the analysis tools (Static Timing Analysis and Power Analysis). To demonstrate the effectiveness of iEDA, we implement and tape out three chips of different scales (from 700k to 1.5M gates) on different process nodes (110nm and 28nm) with iEDA. iEDA is publicly available from the project home page http://ieda.oscc.cc.

cs.AR

Analytical Solution of Poisson's Equation with Application to VLSI Global Placement

Poisson's equation has been used in VLSI global placement for describing the potential field caused by a given charge density distribution. Unlike previous global placement methods that solve Poisson's equation numerically, in this paper, we provide an analytical solution of the equation to calculate the potential energy of an electrostatic system. The analytical solution is derived based on the separation of variables method and an exact density function to model the block distribution in the placement region, which is an infinite series and converges absolutely. Using the analytical solution, we give a fast computation scheme of Poisson's equation and develop an effective and efficient global placement algorithm called Pplace. Experimental results show that our Pplace achieves smaller placement wirelength than ePlace and NTUplace3. With the pervasive applications of Poisson's equation in scientific fields, in particular, our effective, efficient, and robust computation scheme for its analytical solution can provide substantial impacts on these fields.

cs.OH

Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming

The 0-1 linear programming problem with nonnegative constraint matrix and objective vector e origins from many NP-hard combinatorial optimization problems. In this paper, we consider recovering an optimal solution to the problem from a weighted linear programming.We first formulate the problem equivalently as a sparse optimization problem. Next, we consider the consistency of the optimal solution of the sparse optimization problem and the weighted linear programming problem. In order to achieve this, we establish nonnegative partial s-goodness of the constraint matrix and the weighted vector. Further, we use two quantities to characterize a sufficient condition and necessary condition for the nonnegative partial s-goodness. However, the two quantities are difficult to calculate, therefore, we provide a computable upper bound for one of the two quantities to verify the nonnegative partial s-goodness. Finally, we give three examples to illustrate that our theory is effective and verifiable.

math.OC

PeF: Poisson's Equation Based Large-Scale Fixed-Outline Floorplanning

Floorplanning is the first stage of VLSI physical design. An effective floorplanning engine definitely has positive impact on chip design speed, quality and performance. In this paper, we present a novel mathematical model to characterize non-overlapping of modules, and propose a flat fixed-outline floorplanning algorithm based on the VLSI global placement approach using Poisson's equation. The algorithm consists of global floorplanning and legalization phases. In global floorplanning, we redefine the potential energy of each module based on the novel mathematical model for characterizing non-overlapping of modules and an analytical solution of Poisson's equation. In this scheme, the widths of soft modules appear as variables in the energy function and can be optimized. Moreover, we design a fast approximate computation scheme for partial derivatives of the potential energy. In legalization, based on the defined horizontal and vertical constraint graphs, we eliminate overlaps between modules remained after global floorplanning, by modifying relative positions of modules. Experiments on the MCNC, GSRC, HB+ and ami49\_x benchmarks show that, our algorithm improves the average wirelength by at least 2\% and 5\% on small and large scale benchmarks with certain whitespace, respectively, compared to state-of-the-art floorplanners.

cs.AR

Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval

In a mobile network, wireless data broadcast over $m$ channels (frequencies) is a powerful means for distributed dissemination of data to clients who access the channels through multi-antennae equipped on their mobile devices. The $δ$-antennae largest weight data retrieval ($δ$ALWDR) problem is to compute a schedule for downloading a subset of data items that has a maximum total weight using $δ$ antennae in a given time interval. In this paper, we propose a ratio $1-\frac{1}{e}-ε$ approximation algorithm for the $δ$-antennae largest weight data retrieval ($δ$ALWDR) problem that has the same ratio as the known result but a significantly improved time complexity of $O(2^{\frac{1}ε}\frac{1}εm^{7}T^{3.5}L)$ from $O(ε^{3.5}m^{\frac{3.5}ε}T^{3.5}L)$ when $δ=1$ \cite{lu2014data}. To our knowledge, our algorithm represents the first ratio $1-\frac{1}{e}-ε$ approximation solution to $δ$ALWDR for the general case of arbitrary $δ$. To achieve this, we first give a ratio $1-\frac{1}{e}$ algorithm for the $γ$-separated $δ$ALWDR ($δ$A$γ$LWDR) with runtime $O(m^{7}T^{3.5}L)$, under the assumption that every data item appears at most once in each segment of $δ$A$γ$LWDR, for any input of maximum length $L$ on $m$ channels in $T$ time slots. Then, we show that we can retain the same ratio for $δ$A$γ$LWDR without this assumption at the cost of increased time complexity to $O(2^γm^{7}T^{3.5}L)$. This result immediately yields an approximation solution of same ratio and time complexity for $δ$ALWDR, presenting a significant improvement of the known time complexity of ratio $1-\frac{1}{e}-ε$ approximation to the problem.

cs.DS