Affiliation:
1. Univ. of California at Los Angeles, Los Angeles
Abstract
We summarize the techniques of implementing move-based hypergraph partitioning heuristics and evaluating their performance in the context of VLSI design applications. Our first contribution is a detailed software architecture, consisting of seven reusable components, that allows flexible, efficient and accurate assessment of the practical implications of new move-based algorithms and partitioning formulations. Our second contribution is an assessment of the modern context for hypergraph partitioning research for VLSI design applications. In particular, we discuss the current level of sophistication in implementation know-how and experimental evaluation, and we note how requirements for real-world partitioners - if used as motivation for research - should affect the evaluation of prospective contributions. Two "implicit decisions" in the implementation of the Fiduccia-Mattheyses heuristic are used to illustrate the difficulty of achieving meaningful experimental evaluation of new algorithmic ideas.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Reference46 articles.
1. {1} C. J. Alpert "Partitioning Benchmarks for VLSI CAD Community" Web page http://vlsicad.cs.ucla.edu/~cheese/benchmarks.html {1} C. J. Alpert "Partitioning Benchmarks for VLSI CAD Community" Web page http://vlsicad.cs.ucla.edu/~cheese/benchmarks.html
2. A hybrid multilevel/genetic approach for circuit partitioning
3. Recent directions in netlist partitioning: a survey
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献