Search arXivSearch

arXiv · 2505.03771

OneDSE: Metric-Conditioned Inverse Modeling and Active Search for Sample-Efficient DSE

Abstract

We identify two key challenges in prior CPU design space exploration (DSE) approaches: (a) short-horizon prediction is forward-only: modeling PPA metrics from design parameters while designers start from metric targets, and (b) long-horizon exploration is slow: evaluating thousands of candidates on cycle-accurate simulators. This work presents OneDSE, which unifies short-horizon design prediction and long-horizon design optimization through Metric-conditioned INverse Design (MIND) and a Surrogate-Assisted Inverse Loop (SAIL). First, OneDSE-MIND inverts the prevailing recipe: conditioned on the workload, it predicts the design that achieves target metrics, finding strong design points in a handful of validations. An information-theoretic analysis supports this inversion approach: the workload observation raises the design information that metrics carry by 12-32% otherwise a workload-blind approach makes richer metrics harder to invert. Second, OneDSE-SAIL embeds MIND in a measurement loop in which fine-tuned inverse proposals drive early sample efficiency while coordinated multi-parameter operators secure the endpoints, under a distance-aware acquisition. Results show that on five TailBench workloads using gem5, MIND reaches, with as few as 1-58 validations, design quality that ArchGym's genetic algorithm needs 11-357x as many evaluations to match (median 68x). Further, SAIL attains a geometric-mean 0.98x the full 6400-evaluation GA optimum with 12.5x fewer online evaluations, exceeding it outright on one workload, versus 0.83x for the strongest budget-matched baseline (SMAC). Finally, we demonstrate generality beyond CPUs by extending OneDSE to design space exploration of a DRAM memory controller and the FEATHER reconfigurable AI accelerator.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ritik Raj, Akshat Ramachandran, Danny Samuel, Jeff Nye, Shashank Nemawarkar, Tushar Krishna. 2026-08-17. OneDSE: Metric-Conditioned Inverse Modeling and Active Search for Sample-Efficient DSE. https://arxiv.org/abs/2505.03771

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bi-SamplerZ: A Rejection-Aware Cooperative Gaussian Sampling Framework for Falcon Signature Hardware

We present Bi-SamplerZ, a rejection-aware cooperative sampling framework that converts this idle capacity into useful computation. After an asymmetric accept/reject outcome, Bi- SamplerZ latches the completed logical result and dynamically reassigns the released physical datapath to the unfinished target. The two paths then evaluate fresh independent candidates for the same remaining distribution. We show that this post-rejection cooperation increases the assisted-round completion probability without modifying the underlying candidate distribution or Bernoulli acceptance rule, and we state the randomness-allocation conditions required to preserve the joint output distribution of the original pair of logical sampler calls

cs.AR

A Multi-Engine Dataflow for MoE Decoding on Scratchpad-Based Tensor Accelerators

Mixture-of-Experts (MoE) decoding on scratchpad-based tensor accelerators (STA) is dominated by moving expert weights while the compute engines sit idle. This traffic is hard to hide, because the experts are known only after routing, and hard to shrink without losing quality or adding critical-path work. We present CARDAN, which represents each expert-weight matrix as a vector-quantized component plus a shared-basis low-rank component and co-designs this representation with a multi-engine decoding dataflow. The representation separates expert-common from expert-private work, so the dataflow overlaps DMA with computation on several engines. Across five MoE families on AWS Trainium3, CARDAN matches or improves BF16-teacher perplexity across all five models and speeds up batch-one decoding by 1.15-1.31x over AWS dense MoE megakernels, rising to 1.7x at batch size 16.

cs.AR

Dissecting How Die Scaling Breaks GPU Fine-grained Scheduling

Modern GPUs are no longer physically symmetric. Die scaling leads to both manufacturing-driven floorsweeping and cache and memory partitioning. The former creates chip-specific compute topologies, while the latter causes non-uniform memory access. These asymmetries are substantial. Topology-oblivious compute unit allocation can lead to up to 1.33x performance variation, while remote accesses increase HBM latency by up to 67% and nearly double L2 latency. However, these asymmetries are hidden behind the GPU's logical resource abstractions and can vary across chips. We develop lightweight characterization methods to uncover per-chip compute topology and memory affinity. We then use the discovered information to make existing fine-grained scheduling asymmetry-aware, considering not only how many resources are allocated but also which physical resources are assigned. Across full-GPU kernel execution, intra-application multiplexing, and inter-application co-location, asymmetry-aware scheduling improves mainstream kernels by up to 1.22x, multiplexed LLM inference by up to 14.3%, and avoids up to 1.33x performance variation.

cs.AR