A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design

In this paper, we present a bottom-up clustering algorithm based on recursive collapsing of small cliques in a graph. The sizes of the small cliques are derived using random graph theory. This clustering algorithm leads to a natural parallel implementation in which multiple processors are used to id...

Full description

Saved in:
Bibliographic Details
Published in:30th ACM/IEEE Design Automation Conference pp. 755 - 760
Main Authors: Cong, Jason, Smith, M'Lissa
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 01.07.1993
Series:ACM Conferences
Subjects:
Algorithm design and analysis
Application software
Circuit stability
Clustering algorithms
Computer science
Hardware > Electronic design automation > Physical design (EDA) > Partitioning and floorplanning
Hardware > Very large scale integration design
Iterative algorithms
Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms
Mathematics of computing > Discrete mathematics > Graph theory > Paths and connectivity problems
Partitioning algorithms
Terminology
Very large scale integration
ISBN:9780897915779, 0897915771
ISSN:0738-100X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a bottom-up clustering algorithm based on recursive collapsing of small cliques in a graph. The sizes of the small cliques are derived using random graph theory. This clustering algorithm leads to a natural parallel implementation in which multiple processors are used to identify clusters simultaneously. We also present a cluster-based partitioning method in which our clustering algorithm is used as a preprocessing step to both the bisection algorithm by Fiduccia and Mattheyses and a ratio-cut algorithm by Wei and Cheng. Our results show that cluster-based partitioning obtains cut sizes up to 49.6% smaller than the bisection algorithm, and obtains ratio cut sizes up to 66.8% smaller than the ratio-cut algorithm. Moreover, we show that cluster-based partitioning produces much stabler results than direct partitioning.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780897915779
0897915771
ISSN:0738-100X
DOI:10.1145/157485.165119