Search arXivSearch

arXiv · 2408.07886

Physically Aware Synthesis Revisited: Guiding Technology Mapping with Primitive Logic Gate Placement

Abstract

A typical VLSI design flow is divided into separated front-end logic synthesis and back-end physical design (PD) stages, which often require costly iterations between these stages to achieve design closure. Existing approaches face significant challenges, notably in utilizing feedback from physical metrics to better adapt and refine synthesis operations, and in establishing a unified and comprehensive metric. This paper introduces a new Primitive logic gate placement guided technology MAPping (PigMAP) framework to address these challenges. With approximating technology-independent spatial information, we develop a novel wirelength (WL) driven mapping algorithm to produce PD-friendly netlists. PigMAP is equipped with two schemes: a performance mode that focuses on optimizing the critical path WL to achieve high performance, and a power mode that aims to minimize the total WL, resulting in balanced power and performance outcomes. We evaluate our framework using the EPFL benchmark suites with ASAP7 technology, using the OpenROAD tool for place-and-route. Compared with OpenROAD flow scripts, performance mode reduces delay by 14% while increasing power consumption by only 6%. Meanwhile, power mode achieves a 3% improvement in delay and a 9% reduction in power consumption.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hongyang Pan, Cunqing Lan, Yiting Liu, Zhiang Wang, Li Shang, Xuan Zeng, Fan Yang, Keren Zhu. 2024-08-15. Physically Aware Synthesis Revisited: Guiding Technology Mapping with Primitive Logic Gate Placement. https://doi.org/10.1145/3676536.3676676

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

KEEP EXPLORING

Related papers

Convex algebras on an interval with semicontinuous monotone operations

In a recent work of Matteo Mio on compact quantitative equational theories (here compact means that all its consequences are derivable by means of finite proofs) convex algebras on the carrier set [0,1] whose operations are monotone and satisfy certain semicontinuity properties occurred. We fully classify those algebraic structures by giving an explicit construction of all possible convex operations on [0,1] possessing the mentioned properties. Our result thus describes exactly the range of theories to which Mio's theorem applies.

cs.LO

Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows

We study runtime monitoring for distributed LLM-agent workflows. In an asynchronous execution, a decision can only depend on events that are causally visible to the lifeline that makes it: an event that appears earlier in some log may still be unknown locally. We extend the ZipperGen agent-workflow framework with Causal Past Logic (CPL), an adaptation of PT-DTL to guards in if-constructs and while loops. In addition to standard past-time modalities such as previous and since, a guard can inspect the latest causally visible event of another lifeline and selected variables stored there. The owner evaluates the guard online to select the next branch or loop step. We adapt the knowledge-vector monitor to ZipperGen and prove that the locally computed monitor value coincides with the denotational semantics of the guard at the current event.

cs.LO

Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods

This work introduces a general obstructional framework, the "Double Bind," exposing intrinsic structural limitations of formal verification across computational complexity, mathematical physics and broader theoretical domains. Structurally, it operates as a nested case-switch mechanism: its two primary branches (horns) never activate simultaneously, nor are both guaranteed to trigger, while the first contains a nested switch where exactly one specific case is activated. We demonstrate how the expectation of a formally verifiable proof regarding SAT solver complexity (e.g., via Coq) conflicts with the fundamental limits of computation. While this suggests the logical undecidability of the P vs NP problem, the Double Bind framework resolves the apparent paradox. This obstruction encompasses all standard complexity barriers, such as relativization, natural proofs, and algebrization, while fundamentally blocking a vast class of potential future proof strategies not covered by traditional limitations. To establish its universality, we derive a second formulation via a prefix-closure topology on Deterministic Turing Machine programs and Kolmogorov complexity. This leads to the "Principle of General Non-Measurability," proving that such computational double binds stem from a deep, invariant geometric structure. We show that this framework governs a wide class of foundational limits, analyzing its implications across Geometric Complexity Theory (GCT), the certification of the Langlands program, cryptography, and the theoretical boundaries of quantum supremacy. Finally, we expose a hidden, correlated assumption within the theory of one-way functions. Given the subtle architecture of the framework, the introductory sections provide an essential narrative disambiguation to explicitly separate it from conventional misapplications of Rice's theorem.

cs.LO