By Topic

A concurrent approach to clustering algorithm with applications to VLSI domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Iqbal, S.M.A. ; Dept. of Comput. Sci. & Eng., Premier Univ., Chittagong ; Monir, M.I. ; Sayeed, T. ; Misbah-Uddin, A.H.M.

Circuit partitioning plays an important role in physical design automation of very large scale integration (VLSI) chips. In this brief we present a new connectivity based top down as well as bottom up approach to clustering algorithm for VLSI circuit partitioning. The proposed clustering algorithm partitions the circuit by focusing on highly interconnected cell groups. This clustering algorithm leads to a parallel implementation in which multiple processors are used to identify clusters simultaneously. The process starts with forming clusters by grouping the cells that are tightly connected and as well as the cells that are loosely connected. Considering both types of groups has the advantage that clusters formed from this technique will be highly connected and compact too. Therefore the proposed clustering method can reduce the size and also speed-up the large-scale partitioning problem without loosing partitioning solution qualities. The performance of the proposed clustering algorithm is evaluated on a standard set of partitioning benchmark-ISPD98 benchmark suite.

Published in:

Computer and Information Technology, 2008. ICCIT 2008. 11th International Conference on

Date of Conference:

24-27 Dec. 2008