Journal ArticleDOI
Multiple-way network partitioning with different cost functions
Reads0
Chats0
TLDR
It is shown that certain portions of the algorithm must be revised in order to maintain a relatively low time complexity for the modified algorithms.Abstract:
An adaptation to multiple blocks of a two-block network partitioning algorithm by Krishnamurthy was previously presented and analyzed by the author (see ibid., vol.38, p.62-81, 1989). The algorithm assumed one of several possible generalizations of two-way partitioning to multiple-way partitioning. The problem of adapting this algorithm to work with different generalizations more suitable for other types of applications of network partitioning is considered. It is shown that certain portions of the algorithm must be revised in order to maintain a relatively low time complexity for the modified algorithms. Experimental results are given. >read more
Citations
More filters
Journal ArticleDOI
Recent directions in netlist partitioning: a survey
TL;DR: This survey describes research directions in netlist partitioning during the past two decades in terms of both problem formulations and solution approaches, and discusses methods which combine clustering with existing algorithms (e.g., two-phase partitioning).
Proceedings ArticleDOI
Multilevel k-way hypergraph partitioning
George Karypis,Vipin Kumar +1 more
TL;DR: A new multilevel k-way hypergraph partitioning algorithm that substantially outperforms the existing state-of-the-art K-PM/LR algorithm for multi-way partitioning, both for optimizing local as well as global objectives.
Patent
Advanced modular cell placement system
TL;DR: In this article, a system for determining an affinity associated with relocating a cell located on a surface of a semiconductor chip to a different location on the surface is described, where each cell may be part of a cell net containing multiple cells.
Journal ArticleDOI
Assignment of cells to switches in PCS networks
Arif Merchant,Bhaskar Sengupta +1 more
TL;DR: The authors formulate the problem exactly as an integer programming problem and propose a heuristic solution for this problem and show that it performs extremely well.
Proceedings ArticleDOI
Partitioning-based standard-cell global placement with an exact objective
TL;DR: A new top-down quadrisection-based global placer for standard-cell layout called QUAD is presented, which can achieve improvements in wirelength and congestion distribution over GORDIAN-L/DOMINO (a leading quadratic placer with linear wirelength objective and detailed placement improvement).
References
More filters
Journal ArticleDOI
An efficient heuristic procedure for partitioning graphs
Brian W. Kernighan,Shou-De Lin +1 more
TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
Proceedings ArticleDOI
A Linear-Time Heuristic for Improving Network Partitions
TL;DR: An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network.
Journal ArticleDOI
Multiple-way network partitioning
TL;DR: A multiple-block network partitions algorithm adapted from a two-block iterative improvement partitioning algorithm and of the level gain concept to multiple blocks seeks to improve the partition uniformly with respect to all blocks as oppose to making repeated uses of two-way partitioning.
Journal ArticleDOI
An Improved Min-Cut Algonthm for Partitioning VLSI Networks
TL;DR: This-paper generalizes the ideas of Fiduccia and Mattheyses and suggests a class of increasingly sophisticated heuristics, and shows that the computational complexity of any specific heuristic in the suggested class remains linear in the size of the network.
Journal ArticleDOI
Graph bisection algorithms with good average case behavior
TL;DR: A polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output is described, which shows that the algorithm chooses the former course with high probability for many natural classes of graphs.