Pith. sign in

REVIEW 4 major objections 4 minor 41 references

DAS-MP: Enabling High-Quality Macro Placement with Enhanced Dataflow Awareness

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read DAS-MP claims that hidden dataflow between macros and standard-cell clusters, plus area- and orientation-aware fine-tuning, improves macro placement quality.

desk verdict Solid incremental EDA paper, but the headline gains are in-sample and the abstract's runtime claim is contradicted by its own Table V. read the letter →

arxiv 2505.16445 v1 pith:X2EDRENC submitted 2025-05-22 cs.AR

Xiaotian Zhao , Zixuan Li , Yichen Cai , Tianju Wang , Yushan Pan , Xinfei Guo This is my paper · ORCID
classification cs.AR
keywords macroplacementdataflowawarenessfloorplanninghalf-perimeterwirelengthcongestionoptimizationsimulatedannealingstandardcellclustersorientationflipping
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

DAS-MP is a macro placement method whose central claim is that the dataflow connections between macros and standard-cell clusters are a largely untapped source of placement quality. The paper argues that previous dataflow-aware placers considered only direct macro-to-macro links and therefore missed constraints that standard-cell clusters impose on macro positions. DAS-MP extracts direct and indirect macro-macro connections, one-hop macro-cell connections, and two-hop macro-cell-cell connections, folds them into a weighted half-perimeter wirelength (HPWL) loss for simulated annealing, and then refines the placement with area-aware weighting and dataflow-directed macro flipping. On seven benchmark designs, the paper reports 7.9% average HPWL improvement, 82.5% lower congestion overflow, and post-route timing gains of 36.97% in worst negative slack and 59.44% in total negative slack over the baseline dataflow-aware macro placer, at under 1.5% runtime overhead. If true, this makes enhanced dataflow awareness a cheap and effective complement to existing macro placers.

What carries the argument

The load-bearing object is a weighted, directed dataflow graph whose nodes are macro clusters and standard-cell clusters, with edge weights derived from connection bit width and, for cell-cluster-to-cell-cluster edges, the product of a constant $k$, bit width, cluster area, and cluster instance count. This graph feeds a simulated-annealing loss with three HPWL terms, $\mathrm{WL}_{m-m}$, $\mathrm{WL}_{m-c}$, and $\mathrm{WL}_{m-c-c}$, where the two-hop term is refined by a backward-feedback weight and a normalized macro-area divisor. The orientation fine-tuning step projects three vector types, $V_{\mathrm{mm}}$, $V_{\mathrm{mc}}$, and $V_{\mathrm{mcc}}$, onto x and y axes with weights $\alpha=0.55$, $\beta=0.3$, and $\gamma=0.15$, then flips each macro in the direction of larger total projection.

What would settle it

Run DAS-MP with the published hyperparameters on macro-heavy designs not used in tuning and compare HPWL, congestion overflow, and post-route WNS/TNS against the baseline dataflow-aware macro placer; if the average 7.9% HPWL improvement fails to reproduce or reverses on several of those designs, the reported gains are at least partly overfit to the benchmark suite.

Watch

Extended reading notes

Core claim

The paper's central claim, stated on its own terms, is that macro placement quality can be improved substantially by treating hidden dataflow relationships between macros and standard-cell clusters, and among cell clusters themselves, as explicit placement constraints. The proposed DAS-MP pipeline first performs threshold-limited hierarchical clustering, then extracts four types of connections: one-hop direct macro-macro connections, one-hop indirect macro-macro connections through shared cell clusters, one-hop macro-cell connections, and two-hop macro-cell-cell connections. These connections are assigned weights based on bit width, cluster area, and instance count, and are combined into the simulated-annealing loss as three HPWL terms for macro-macro, macro-cell, and macro-cell-cell flows. Two fine-tuning steps follow: a backward-feedback model scales the two-hop weight by the one-hop weight and by normalized macro area so that larger macros are pushed toward boundaries while smaller macros stay near their cell clusters, and a dataflow-vector decomposition decides each macro's orientation by projecting macro-macro, macro-cell, and macro-cell-cell vectors onto the x and y axes and flipping in the dominant direction. The paper's experiments show that this complete pipeline beats the baseline on HPWL, congestion, and post-route timing across all seven tested designs.

Load-bearing premise

The numerical weights $\alpha=0.55$, $\beta=0.3$, $\gamma=0.15$ and the constant $k$ in the cell-cluster edge weight were tuned on the same seven benchmarks, and the reported gains assume these values transfer to unseen designs.

Editorial extensions

If this is right

  • Standard-cell-aware dataflow can be added to an SA macro placer without retraining, improving HPWL and congestion at the same time.
  • The common practice of pushing macros to chip boundaries is not always optimal; dataflow intensity can justify interior macro locations.
  • Dataflow direction can be converted automatically into macro orientation decisions, so orientation need not be a manual or brute-force step.
  • Two-hop cell-cell connections carry enough placement-relevant information to influence macro placement, beyond one-hop macro-cell links.
  • Because the added extraction and fine-tuning runtime stays below 1.5% of the total macro placement time, the method is cheap enough for iterative physical design flows.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper's claims, the alpha/beta/gamma weights and the constant k were selected by trials on the same seven benchmarks, so a held-out test is the natural next check of whether the improvements transfer.
  • The extracted macro-cell and cell-cell connections could also be exported as fence or guide constraints to downstream standard-cell placement, potentially improving the rest of the P&R flow rather than only the macro layer.
  • The dataflow-vector flipping rule acts like a principal-component alignment; it might be extended to weight timing-critical connections more heavily, trading some wirelength for slack improvements.
  • If the gains hold across diverse designs, dataflow extraction of this kind could become a standard preprocessing step for both analytical and RL-based macro placers, not just SA-based ones.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes DAS-MP, a macro placement methodology that augments a simulated-annealing-based dataflow-aware placer with additional dataflow relationships involving standard-cell clusters. Specifically, it extracts macro-to-cell, cell-to-cell, and two-hop macro-cell-cell connections, folds them into an SA loss function, and then applies two fine-tuning steps: an area-based weight feedback model intended to reduce congestion, and a dataflow-vector-based macro flipping heuristic intended to optimize macro orientation. The paper reports experiments on seven open-source designs, comparing against TMP, RTL-MP, and Hier-RTLMP, and claims average improvements of 7.9% in HPWL, 82.5% in congestion overflow, 36.97% in WNS, and 59.44% in TNS over RTL-MP, with a runtime overhead of less than 1.5%.

Significance. If the reported results hold, the paper makes a useful and practical contribution: it extends dataflow-aware macro placement beyond macro-to-macro relationships to include macro-cell and cell-cell dataflow, and it demonstrates that two light-weight fine-tuning mechanisms can further improve placement quality. The full-flow evaluation through routing, the ablation study in Table VI separating area-based and orientation-based fine-tuning, and the detailed connection-count statistics in Table II are strengths; the paper addresses a real gap in current macro placers and is compatible with the OpenROAD flow. The main reservations concern runtime accounting, reproducibility of the tuned weights, and the clarity of the timing/power notation, as detailed below.

major comments (4)
  1. [Section VII-F and Table V] The abstract's claim of 'less than a 1.5% runtime overhead' is contradicted by the paper's own Table V. The average total runtime of DAS-MP (DE+FT) is reported as 208.71 s versus 66.99 s for RTL-MP, a 3.12x increase (the text in Section VII-F says 3.21x, which is also inconsistent). The 1.38% figure in Fig. 12(a) is the fraction of DAS-MP's own total runtime spent on dataflow extraction and fine-tuning, not the overhead relative to RTL-MP. Please correct the abstract and Section VII-F, and report the end-to-end runtime ratio as a headline number instead of the share of runtime.
  2. [Section VII-A, Eq. 13, Eq. 4] The headline quality gains are in-sample estimates. The weights alpha=0.55, beta=0.3, and gamma=0.15 in Eq. 13 were 'determined based on multiple trials across various design scales,' and the seven benchmarks were selected after 'extensive experiments'; no held-out design, cross-validation, seed variation, or error bars are provided. In addition, the constant k in Eq. 4 is never given a numerical value or a selection procedure, so the two-hop weight w2 in Eq. 5 is not reproducible from the manuscript. Please add an out-of-sample evaluation (for example, leave-one-benchmark-out or a held-out design), report sensitivity of the results to alpha, beta, gamma, and k, and state the value of k.
  3. [Section VII-E and Table IV] The notation for 'improvement' in the timing and power table is internally inconsistent. The text states that a positive 'improvement' in WNS/TNS denotes degradation, yet the 'Avg. Improv.*' row marks DAS-MP (DE+FT) as 36.97% and 59.44% with upward arrows while the individual rows show WNS and TNS moving toward zero, which is an improvement. The power and area entries are also labeled with downward arrows even though the accompanying text says power increases by 2.24% and area by 1.3%. Please define 'improvement' with one consistent convention, make the arrows match that convention, and recompute the average row accordingly.
  4. [Section IV-B and Algorithm 1] The indirect macro-macro extraction in Algorithm 1 appears to add virtual connections for every shared cell cluster or shared cell instance, but the text in Section IV-B identifies the exclusion of clock, reset, and other common high-fanout signals as a key challenge. No filtering step is visible in Algorithm 1 or described in the surrounding text. If such signals are not excluded, the proposed indirect macro-macro connections will be created between all macros sharing these signals, and the strengths w_i in Eq. 2 will be dominated by spurious common signals. Please describe how common signals are filtered, or state explicitly that they are absent from the data structures used in Algorithm 1.
minor comments (4)
  1. [Eq. 1] The text says 'wx is a weight factor defined by dataflow bit width,' but Eq. 1 uses w0 and w1; please make the notation consistent.
  2. [Table V] The column headers for the two DAS-MP (DE+FT) subcolumns are ambiguous; please label them as 'optimized M-C-C extraction' and 'total with flipping,' and use a single consistent multiplier in the average row (3.12x, not 3.21x).
  3. [Section VI-A, Eq. 6 and Eq. 8] The transition from loss = w1*w2 in Eq. 6 to loss = sqrt(w1*w2)/A' in Eq. 8 is not motivated; a sentence explaining the role of the square root would improve reproducibility.
  4. [Section VII-B] Table II reports counts of unique connections but no run-to-run variation for the SA-based placement; please state the number of seeds or the variance of the HPWL results reported in Tables III and IV.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the claimed gains are measured by an external OpenROAD P&R flow on external benchmarks; in-sample tuning of α/β/γ is a generalization caveat, not a circular reduction.

full rationale

The paper's central claim is an empirical one: DAS-MP improves HPWL, congestion, WNS, and TNS relative to RTL-MP. The evaluation is conducted through the full OpenROAD placement-and-routing flow on seven external benchmarks, with RTL-MP, Hier-RTLMP, and TMP as external baselines. The loss function in Eq. 5 is a weighted sum of macro-related HPWL terms, but the reported HPWL and PPA numbers come from the downstream P&R flow, so the improvement is not identical to the optimized objective by construction. The dataflow-extraction component is taken from the authors' prior work [11], and the flipping mechanism overlaps prior work [34]; these are self-citations, but the current paper re-implements and evaluates the combined system, so the result does not reduce to an unverified citation. The most notable weakness is in-sample tuning: Section VI-B3 states that α=0.55, β=0.3, γ=0.15 were 'determined based on multiple trials across various design scales,' and Section VII-A states the seven benchmarks were chosen after extensive experiments. This means the reported average improvements are on the same designs used for hyperparameter selection, and the constant k in Eq. 4 is not given, so the results may not generalize. However, that is a statistical-validity and reproducibility concern rather than a circular derivation: no equation is defined in terms of the quantity it is supposed to predict, and the final metrics are externally computed. The self-citations and in-sample tuning are sufficient for a modest score but do not make the central claim equivalent to its inputs.

Assumptions & free parameters 4 free parameters · 5 assumptions · 1 invented entities

The central claim rests on a stack of modeling choices: cluster granularity, bitwidth-based weights, a two-hop cutoff, boundary-push heuristics, and hyperparameters tuned on the evaluation set. None of these choices is machine-verified or independently calibrated, so the reported gains are conditional on them.

free parameters (4)
  • alpha, beta, gamma (VT projection weights) = 0.55, 0.30, 0.15
    Eq. 13; Section VI-B3 states they were determined by multiple trials across various design scales, with the evaluation benchmarks as the same set, so this is in-sample tuning.
  • k (cell-cluster to cell-cluster weighting constant) = unspecified
    Eq. 4 defines w_j = k * bitwidth * cluster area * instance count; k is never given a value or a sensitivity study, yet it sets the strength of every two-hop connection.
  • two-hop scope cutoff = 2 hops
    Section VI-B limits analysis to two hops because 'experiments show' farther cells have minimal influence; no experiment or reference is provided, and this cutoff changes the extracted graph.
  • clustering threshold = not reported
    Section III says clusters are split or merged when instance count exceeds or falls below a preset threshold; the threshold is inherited from the clustering engine but not disclosed, and it determines cluster granularity.
assumptions (5)
  • domain assumption Standard cell clusters can be treated as pseudo-macros whose placement influences macro placement.
    Section I and Fig. 1: this is the motivation for extracting macro-cell dataflow; it is asserted, not derived, and it is the mechanism behind DAS-MP.
  • domain assumption Bitwidth of connections is the correct proxy for dataflow importance.
    Eqs. 1, 2, and 4 build all loss weights from bitwidth; no validation is given that bitwidth correlates with timing or congestion impact.
  • domain assumption Larger macros should be pushed to the chip boundary and smaller macros kept near cell clusters.
    Section VI-A2 adopts this engineering heuristic for area-aware fine-tuning; no data in the paper validates it for all designs.
  • ad hoc to paper Macro orientation is limited to 0 and 180 degree flips, and flipping can be guided by the sign of projected dataflow vectors.
    Section VI-B introduces the vector-decomposition flipping rule; its optimality is not proven and the weights are tuned on the evaluation set.
  • standard math Simulated annealing with sequence-pair representation finds a near-optimum of the weighted HPWL loss.
    The optimizer relies on the standard SA framework [32] and sequence-pair representation [33]; the paper does not verify global optimality.
invented entities (1)
  • Virtual indirect macro-macro connections
    purpose: Connect macros that share the same cell cluster or cell fanout, so their shared dataflow can enter the SA loss function.
    Algorithm 1 creates these graph edges; they have no falsifiable handle outside the paper's loss function, though they are a reasonable modeling device.

how reviews work

0 comments
Cite this review

Pith. "Pith review of DAS-MP: Enabling High-Quality Macro Placement with Enhanced Dataflow Awareness." pith.science (2026). https://pith.science/paper/X2EDRENC

@misc{pith2026250516445,
  author       = {Pith},
  title        = {Pith review of: DAS-MP: Enabling High-Quality Macro Placement with Enhanced Dataflow Awareness},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/X2EDRENC}},
  note         = {Machine review of arXiv:2505.16445}
}
read the original abstract

Dataflow is a critical yet underexplored factor in automatic macro placement, which is becoming increasingly important for developing intelligent design automation techniques that minimize reliance on manual adjustments and reduce design iterations. Existing macro or mixed-size placers with dataflow awareness primarily focus on intrinsic relationships among macros, overlooking the crucial influence of standard cell clusters on macro placement. To address this, we propose DAS-MP, which extracts hidden connections between macros and standard cells and incorporates a series of algorithms to enhance dataflow awareness, integrating them into placement constraints for improved macro placement. To further optimize placement results, we introduce two fine-tuning steps: (1) congestion optimization by taking macro area into consideration, and (2) flipping decisions to determine the optimal macro orientation based on the extracted dataflow information. By integrating enhanced dataflow awareness into placement constraints and applying these fine-tuning steps, the proposed approach achieves an average 7.9% improvement in half-perimeter wirelength (HPWL) across multiple widely used benchmark designs compared to a state-of-the-art dataflow-aware macro placer. Additionally, it significantly improves congestion, reducing overflow by an average of 82.5%, and achieves improvements of 36.97% in Worst Negative Slack (WNS) and 59.44% in Total Negative Slack (TNS). The approach also maintains efficient runtime throughout the entire placement process, incurring less than a 1.5% runtime overhead. These results show that the proposed dataflow-driven methodology, combined with the fine-tuning steps, provides an effective foundation for macro placement and can be seamlessly integrated into existing design flows to enhance placement quality.

Figures

Figures reproduced from arXiv: 2505.16445 by the authors.

Figure 1
Figure 1. The illustration shows all dataflow connections, with the uncovered [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. The overview of the overall DAS-MP methodology. The first part is the [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. One-hop direct dataflow connection of macro cluster-cell cluster. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (7 more)
Figure 5
Figure 5. Figure 5: Comparison between one-hop connected cell cluster (only macro [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: Fine-tuning for Macro Specificity Analysis and Optimization. [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]
Figure 7
Figure 7. Figure 7: Macro orientation optimization guided by enhanced dataflow aware [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: Layouts of black parrot with congestion map. The highlighted green cells are from the one-hop connected cell cluster. only, and DAS-MP (DE+FT) with full optimization. The best result for each design is highlighted in bold, with percentage improvements over RTL-MP provi…
Figure 10
Figure 10. Figure 10: Layouts of different macro placers for bp_fe. The red triangles on the corner indicate the orientation of each macro. (a) TMP [35] (b) RTL-MP [8] (c) Hier-RTLMP [10] (d) DAS-MP (DE) [11] (e) DAS-MP (DE+FT) [PITH_FULL_IMAGE:figures/full_fig_p011_10.png]
Figure 11
Figure 11. Figure 11: Congestion maps of different macro placers for [PITH_FULL_IMAGE:figures/full_fig_p011_11.png]
Figure 12
Figure 12. Figure 12: Runtime breakdown comparison between RTL-MP [ [PITH_FULL_IMAGE:figures/full_fig_p012_12.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 40 canonical work pages

  1. [1]

    A graph placement methodology for fast chip design,

    A. Mirhoseini, A. Goldie, M. Yazgan, J. W. Jiang, E. Songhori, S. Wang, Y . J. Lee, E. Johnson, O. Pathak, A. Nazi, J. Pak, A. Tong, K. Srinivasa, W. Hang, E. Tuncer, Q. V . Le, J. Laudon, R. Ho, R. Carpenter, and J. Dean, “A graph placement methodology for fast chip design,”Nature, vol. 594, no. 7862, pp. 207–212, 2021. [Online]. Available: http://dx.doi...

    doi:10.1038/s41586-021-03544-w 2021

  2. [2]

    Floorplanning with graph attention,

    Y . Liu, Z. Ju, Z. Li, M. Dong, H. Zhou, J. Wang, F. Yang, X. Zeng, and L. Shang, “Floorplanning with graph attention,” inProceedings of the 59th ACM/IEEE Design Automation Conference, ser. DAC ’22. Association for Computing Machinery, 2022, p. 1303–1308

    work page 2022

  3. [3]

    Autodmp: Automated dreamplace-based macro placement,

    A. Agnesina, P. Rajvanshi, T. Yang, G. Pradipta, A. Jiao, B. Keller, B. Khailany, and H. Ren, “Autodmp: Automated dreamplace-based macro placement,” inProceedings of the 2023 International Symposium on Physical Design, 2023, pp. 149–157

    work page 2023

  4. [4]

    Assess- ment of reinforcement learning for macro placement,

    C.-K. Cheng, A. B. Kahng, S. Kundu, Y . Wang, and Z. Wang, “Assess- ment of reinforcement learning for macro placement,”arXiv preprint arXiv:2302.11014, 2023

    work page arXiv 2023

  5. [5]

    Data path placement with regularity,

    T. T. Ye and G. De Micheli, “Data path placement with regularity,” IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, vol. 2000-Janua, pp. 264–270, 2000

    work page 2000

  6. [6]

    RTL-Aware Dataflow-Driven Macro Placement,

    A. Vidal-Obiols, J. Cortadella, J. Petit, M. Galceran-Oms, and F. Mar- torell, “RTL-Aware Dataflow-Driven Macro Placement,”Proceedings of the 2019 Design, Automation and Test in Europe Conference and Exhibition, DATE 2019, pp. 186–191, 2019

    work page 2019

  7. [7]

    Dataflow- aware macro placement based on simulated evolution algorithm for mixed-size designs,

    J.-M. Lin, Y .-L. Deng, Y .-C. Yang, J.-J. Chen, and P.-C. Lu, “Dataflow- aware macro placement based on simulated evolution algorithm for mixed-size designs,”IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 29, no. 5, pp. 973–984, 2021

    work page 2021

  8. [8]

    Rtl-mp: toward practical, human-quality chip planning and macro placement,

    A. B. Kahng, R. Varadarajan, and Z. Wang, “Rtl-mp: toward practical, human-quality chip planning and macro placement,” inProceedings of the 2022 International Symposium on Physical Design, 2022, pp. 3–11

    work page 2022

Show all 41 references
  1. [9]

    Multilevel dataflow-driven macro placement guided by rtl struc- ture and analytical methods,

    A. Vidal-Obiols, J. Cortadella, J. Petit, M. Galceran-Oms, and F. Mar- torell, “Multilevel dataflow-driven macro placement guided by rtl struc- ture and analytical methods,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 40, no. 12, pp. 2542...

    2021

  2. [10]

    Hier-rtlmp: A hierarchical automatic macro placer for large-scale complex ip blocks,

    A. B. Kahng, R. Varadarajan, and Z. Wang, “Hier-rtlmp: A hierarchical automatic macro placer for large-scale complex ip blocks,” 2023

    2023

  3. [11]

    Standard cells do matter: Uncovering hidden connections for high-quality macro placement,

    X. Zhao, T. Wang, R. Jiao, and X. Guo, “Standard cells do matter: Uncovering hidden connections for high-quality macro placement,” in 2024 Design, Automation and Test in Europe Conference (DATE), 2024, pp. 1–6

    2024

  4. [12]

    On Joint Learning for Solving Placement and Routing in Chip Design,

    R. Cheng and J. Yan, “On Joint Learning for Solving Placement and Routing in Chip Design,”arXiv, vol. 1, no. NeurIPS, pp. 1–12, 2021. [Online]. Available: http://arxiv.org/abs/2111.00234

    2021 arXiv

  5. [13]

    Placement in Integrated Circuits using Cyclic Reinforcement Learning and Simulated Annealing,

    D. Vashisht, H. Rampal, H. Liao, Y . Lu, D. Shanbhag, E. Fallon, and L. B. Kara, “Placement in Integrated Circuits using Cyclic Reinforcement Learning and Simulated Annealing,”arXiv, no. NeurIPS, pp. 1–8, 2020. [Online]. Available: http://arxiv.org/abs/2011.07577

    2020 arXiv

  6. [14]

    DREAMPlace: Deep Learning Toolkit-Enabled GPU Acceleration for Modern VLSI Placement,

    Y . Lin, Z. Jiang, J. Gu, W. Li, S. Dhar, H. Ren, B. Khailany, and D. Z. Pan, “DREAMPlace: Deep Learning Toolkit-Enabled GPU Acceleration for Modern VLSI Placement,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 40, no. 4, pp. 748–761, 2021

    2021

  7. [15]

    Bayesian optimization for macro placement,

    C. Oh, R. Bondesan, D. Kianfar, R. Ahmed, R. Khurana, P. Agarwal, R. Lepert, M. Sriram, and M. Welling, “Bayesian optimization for macro placement,”arXiv preprint arXiv:2207.08398, 2022

    2022 arXiv

  8. [16]

    PADE: A high-performance placer with automatic datapath extraction and evaluation through high dimen- sional data learning,

    S. Ward, D. Ding, and D. Z. Pan, “PADE: A high-performance placer with automatic datapath extraction and evaluation through high dimen- sional data learning,”Proceedings - Design Automation Conference, pp. 756–761, 2012

    2012

  9. [17]

    Evaluation of routability- driven macro placement with machine-learning technique,

    W. K. Cheng, Y . Y . Guo, and C. S. Wu, “Evaluation of routability- driven macro placement with machine-learning technique,”Proceedings - 2018 7th International Symposium on Next-Generation Electronics, ISNE 2018, vol. 1, no. Isne, pp. 1–3, 2018

    2018

  10. [18]

    Global Placement with Deep Learning-Enabled Explicit Routability Optimization,

    S. Liu, Q. Sun, P. Liao, Y . Lin, and B. Yu, “Global Placement with Deep Learning-Enabled Explicit Routability Optimization,”Proceedings -Design, Automation and Test in Europe, DATE, vol. 2021-Febru, pp. 1821–1824, 2021

    2021

  11. [19]

    A semi- persistent clustering technique for vlsi circuit placement,

    C. Alpert, A. Kahng, G.-J. Nam, S. Reda, and P. Villarrubia, “A semi- persistent clustering technique for vlsi circuit placement,” inProceedings of the 2005 international symposium on Physical design, 2005, pp. 200– 207

    2005

  12. [20]

    A new lp based incremental timing driven placement for high performance designs,

    T. Luo, D. Newmark, and D. Z. Pan, “A new lp based incremental timing driven placement for high performance designs,” inProceedings of the 43rd annual Design Automation Conference, 2006, pp. 1115–1120

    2006

  13. [21]

    Mp-trees: A packing-based macro placement algorithm for mixed-size designs,

    T.-C. Chen, P.-H. Yuh, Y .-W. Chang, F.-J. Huang, and D. Liu, “Mp-trees: A packing-based macro placement algorithm for mixed-size designs,” in Proceedings of the 44th annual Design Automation Conference, 2007, pp. 447–452

    2007

  14. [22]

    eplace: Electrostatics based placement using nesterov’s method,

    J. Lu, P. Chen, C.-C. Chang, L. Sha, D. J.-H. Huang, C.-C. Teng, and C.-K. Cheng, “eplace: Electrostatics based placement using nesterov’s method,” in2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC), 2014, pp. 1–6

    2014

  15. [23]

    RePlAce: Advancing Solution Quality and Routability Validation in Global Placement,

    C. K. Cheng, A. B. Kahng, I. Kang, and L. Wang, “RePlAce: Advancing Solution Quality and Routability Validation in Global Placement,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 38, no. 9, pp. 1717–1730, 2019

    2019

  16. [24]

    Constraint graph-based macro placement for modern mixed-size circuit designs,

    H. C. Chen, Y . L. Chuang, Y . W. Chang, and Y . C. Chang, “Constraint graph-based macro placement for modern mixed-size circuit designs,” IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, pp. 218–223, 2008

    2008

  17. [25]

    Routability-driven blockage-aware macro placement,

    Y .-F. Chen, C.-C. Huang, C.-H. Chiou, Y .-W. Chang, and C.-J. Wang, “Routability-driven blockage-aware macro placement,” inProceedings of the 51st Annual Design Automation Conference, 2014, pp. 1–6

    2014

  18. [26]

    Circular- contour-based obstacle-aware macro placement,

    C.-H. Chiou, C.-H. Chang, S.-T. Chen, and Y .-W. Chang, “Circular- contour-based obstacle-aware macro placement,” in2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC). IEEE, 2016, pp. 172–177

    2016

  19. [27]

    Routability-driven placement for hierarchical mixed-size circuit de- signs,

    M.-K. Hsu, Y .-F. Chen, C.-C. Huang, T.-C. Chen, and Y .-W. Chang, “Routability-driven placement for hierarchical mixed-size circuit de- signs,” inProceedings of the 50th Annual Design Automation Confer- ence, 2013, pp. 1–6

    2013

  20. [28]

    Maxplace (aquired by synopsys),

    Synopsys, “Maxplace (aquired by synopsys),” https://www. synopsys.com/implementation-and-signoff/physical-implementation/ fusion-compiler.html

  21. [29]

    Freeform macro placement technology,

    ——, “Freeform macro placement technology,” https://www.synopsys. com/implementation-and-signoff/physical-implementation/ic-compiler. html

  22. [30]

    Innovus mixed placer,

    Cadence, “Innovus mixed placer,” https://community.cadence.com/ cadence blogs 8/b/breakfast-bytes/posts/innovus-mixed-placer

  23. [31]

    eplace-ms: Electrostatics-based placement for mixed-size circuits,

    J. Lu, H. Zhuang, P. Chen, H. Chang, C.-C. Chang, Y .-C. Wong, L. Sha, D. Huang, Y . Luo, C.-C. Teng, and C.-K. Cheng, “eplace-ms: Electrostatics-based placement for mixed-size circuits,”IEEE Transac- tions on Computer-Aided Design of Integrated Circuits and Systems, vol. 34, ...

    2015

  24. [32]

    Optimization by simulated annealing,

    S. Kirkpatricket al., “Optimization by simulated annealing,”Science, vol. 220, no. 4598, pp. 671–680, 1983

    1983

  25. [33]

    Vlsi module placement based on rectangle-packing by the sequence-pair,

    H. Murataet al., “Vlsi module placement based on rectangle-packing by the sequence-pair,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, no. 12, pp. 1518–1524, 1996

    1996

  26. [34]

    Incredflip: Incre- mental dataflow-driven macro flipping for efficient macro placement refinement,

    X. Zhao, J. Chen, Z. Li, Y . Cai, and G. Xinfei, “Incredflip: Incre- mental dataflow-driven macro flipping for efficient macro placement refinement,” in2025 3rd International Symposium of Electronics Design Automation (ISEDA), 2025

    2025

  27. [35]

    The openroad project: Unleashing hard- ware innovation,

    A. B. Kahng and T. Spyrou, “The openroad project: Unleashing hard- ware innovation,” inProc. GOMAC, 2021

    2021

  28. [36]

    Openroad-flow-script,

    “Openroad-flow-script,” https://github.com/The-OpenROAD-Project/ OpenROAD-flow-scripts

  29. [37]

    Yosys open synthesis suite,

    C. Wolf, “Yosys open synthesis suite,” https://github.com/YosysHQ/ yosys, 2016

    2016

  30. [38]

    Triton macro placer (tmp),

    “Triton macro placer (tmp),” https://github.com/ The-OpenROAD-Project/TritonMacroPlace

  31. [39]

    Ppa-relevant clustering-driven placement for large-scale vlsi designs,

    A. Kahng, S. Kang, S. Kundu, K. Min, S. Park, and B. Pramanik, “Ppa-relevant clustering-driven placement for large-scale vlsi designs,” inProceedings of the 61st ACM/IEEE Design Automation Conference, 2024, pp. 1–6

    2024

  32. [40]

    Tilos macro placement benchmark,

    “Tilos macro placement benchmark,” https://github.com/ TILOS-AI-Institute/MacroPlacement/tree/main/Testcases

  33. [41]

    Nangate 45nm library,

    “Nangate 45nm library,” http://www.nangate.com/

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.