The Min-cut shuffle: toward a solution for the global effect problem of Min-cut placement

Authors:
Inderpal Bhandari;Mark Hirsch;Daniel Siewiorek
Affiliations:
Department of Electrical and Computer Engineering, Carnegie Mellon University;Department of Electrical and Computer Engineering, Carnegie Mellon University;Department of Electrical and Computer Engineering, Carnegie Mellon University
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 1
Cited 3

A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

Min-cost partitioning on a tree structure and applications

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Generalization of Min-Cut Partitioning to Tree Structures and its Applications

IEEE Transactions on Computers
Towards optimizing global MinCut partitioning

EURO-DAC '91 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Global Effect Problem is introduced in the context of adapting Min-cut partitioning for Min-cut placement. A simplified version of the problem is solved in linear time by using a new algorithm, the Min-cut Shuffle. A detailed analysis and implementation for the algorithm is presented.