Design and implementation of move-based heuristics for VLSI hypergraph partitioning

DOI10.1145/351827.384247MaRDI QIDQ5463400zbMATH OpenOpenAlexFDO

Authors Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/351827.384247

zbMATH Keywords

AlgorithmsBalanced min-cut hypergraph partitioningExperimentationMeasurementPerformanceVLSI CAD

Mathematics Subject Classification ID

Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A survey of VLSI circuit partitioning algorithms
• Recent directions in netlist partitioning: a survey
• scientific article; zbMATH DE number 2075198
• scientific article; zbMATH DE number 1241383
• A fast hypergraph min-cut algorithm for circuit partitioning

Cited in

(2)

• New challenges in dynamic load balancing
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem

This page was built for publication: Design and implementation of move-based heuristics for VLSI hypergraph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463400)