Cart (Loading....) | Create Account
Close category search window
 

A circuit partitioning algorithm under path delay constraints

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

3 Author(s)
Minami, J. ; Fac. of Eng., Hiroshima Univ., Japan ; Koide, T. ; Wakabayashi, S.

This paper presents a timing-driven circuit partitioning algorithm for the general delay model. The proposed algorithm consists of the clustering and iterative improvement phases. In the first phase, we reduce the problem size, that is the size of a given graph, with a new clustering algorithm to obtain a partition in a short computation time. Next, the iterative improvement phase based on the Fiduccia and Mattheyses algorithm is applied and then a new path-based timing violation removal algorithm is also performed so as to remove all the timing violations. From experimental results for ISCAS89 benchmarks, we have demonstrated that the proposed algorithm can produce the partitions which mostly satisfy the timing constraints

Published in:

Circuits and Systems, 1998. IEEE APCCAS 1998. The 1998 IEEE Asia-Pacific Conference on

Date of Conference:

24-27 Nov 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.