Article

Free access

A probabilistic multicommodity-flow solution to circuit clustering problems

Authors:

Ching-Wei Yeh,

Chung-Kuan Cheng,

Ting-Ting Y. LinAuthors Info & Claims

ICCAD '92: Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design

Pages 428 - 431

Published: 08 November 1992 Publication History

PDF eReader

References

[1]

B. Bollobas, Random Graphs, Academic Press Inc., 1985, pp.11- 12 and pp.31-53.

Google Scholar

[2]

Join Garbers, "Finding Clusters in VLSI Circuits," Proc. Int. Conf. Computer-Aided Design, 1990, pp.520-523.

Google Scholar

[3]

K.M. Hall, "An r-dimensional Quadratic Placement Algorithm," Management Science, vol. 17, no. 3, Nov. 1970, pp. 219-229.

Digital Library

Google Scholar

[4]

M. iri, "On an Extension of the Maximum Flow Minimum Cut Theorem to Multicommodity Flows," Journal of Operations Research Society of Japan, 5(4), Dec. 1967, pp.697-703.

Google Scholar

[5]

Sungho Kang, "Linear Ordering and Application to Placement," Proc. 20th Design Automation Conf., 1983, pp. 457-464.

Digital Library

Google Scholar

[6]

B.W. Kemighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technical Journal, Vol. 49, No. 2, Feb. 1970, pp. 291-307.

Crossref

Google Scholar

[7]

K. onaga and O. Kakusho, "On Feasibility Conditions of Multicommodity Flows in Networks," IEEE Trans. Circuit Theory, 18(4) 1971, pp. 425-429.

Crossref

Google Scholar

[8]

R.L. Russo, P.H. Oden and P.K. Wolff, St., "A heuristic procedure for the partitioning and mapping of computer logic graphs," IEEE Trans. on Computers, vol. C-20, Dec. 1971, pp. 1455-1462.

Google Scholar

[9]

L.A. Sanchis, "Multi-Way Network Partitioning," IEEE Trans. on Computers, Vol.38, No.l, Jan., 1989, pp.62-81.

Digital Library

Google Scholar

[10]

D. M. Schuler and E. G, Ulrich, "Clustering and Linear Placement," Proc. 9th Design Automation Workshop," 1972, pp.50-56.

Digital Library

Google Scholar

[11]

F. Shahrokhi and D.W. Matula, "The Maximum Concurrent Flow Problem," Journal of the ACM, Vol.37, No.2, April 1990, pp.318-334.

Digital Library

Google Scholar

[12]

Yen-Chuen Wei and Chung-Kuan Cheng, "Toward Efficient Hierarchical Designs by Ratio Cut Partitioning," Proc. IEEE Int. Conf. on Computer-Aided Design, 1989, pp.298-301.

Google Scholar

[13]

Yen-Chuen Wei and Chung-Kuan Cheng, "Two-way Two-level Partitioning Algorithm," Proc. IEEE Int. Conf. on Computer Aided Design, 1990, pp. 516-519.

Google Scholar

[14]

Ching-Wei Yeh, Chung-Kuan Cheng and Ting-Ting Y. Lin, "A General Purpose Multiple-Way Partitioning Algorithm," Proc 28th ACM/IEEE Design Automation Conf., June 1991, pp.421-425.

Digital Library

Google Scholar

Cited By

View all

Cheung CWu YCheng D(2001)Further improve circuit partitioning using GBAW logic perturbation techniquesProceedings of the conference on Design, automation and test in Europe10.5555/367072.367196(233-239)Online publication date: 13-Mar-2001
https://dl.acm.org/doi/10.5555/367072.367196
Wu YYuan XCheng DYoshida K(2000)Circuit partitioning with coupled logic restructuring techniquesProceedings of the 2000 Asia and South Pacific Design Automation Conference10.1145/368434.368862(655-660)Online publication date: 28-Jan-2000
https://dl.acm.org/doi/10.1145/368434.368862
Song JShen ZZhuang WDewilde PRammig FMusgrave G(1998)An effective general connectivity concept for clusteringProceedings of the conference on Design, automation and test in Europe10.5555/368058.368249(398-405)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368249
Show More Cited By

Index Terms

A probabilistic multicommodity-flow solution to circuit clustering problems
1. Applied computing
  1. Physical sciences and engineering
    1. Engineering
2. Hardware
  1. Electronic design automation
    1. Physical design (EDA)
  2. Integrated circuits
    1. Logic circuits

Recommendations

Density-Based Probabilistic Clustering of Uncertain Data
CSSE '08: Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 04

In many applications like moving-objects and sensors databases, data values are inherently uncertain. In these systems, an attribute value can be modeled as a range of possible values, associated with a probability density function. Data mining of the ...
Clustering Large Probabilistic Graphs

We study the problem of clustering probabilistic graphs. Similar to the problem of clustering standard graphs, probabilistic graph clustering has numerous applications, such as finding complexes in probabilistic protein-protein interaction (PPI) ...
Probabilistic consensus clustering using evidence accumulation

Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence accumulation clustering (EAC) paradigm, the clustering ensemble is transformed into ...

Comments

Information & Contributors

Information

Published In

ICCAD '92: Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design

November 1992

637 pages

ISBN:0897915402

Chairmen:
Louise Trevillyan
IBM Corp., Yorktown Heights, NY
,
Michael Lightner
Univ. of Colorado, Boulder

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 08 November 1992

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
250
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)9

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cheung CWu YCheng D(2001)Further improve circuit partitioning using GBAW logic perturbation techniquesProceedings of the conference on Design, automation and test in Europe10.5555/367072.367196(233-239)Online publication date: 13-Mar-2001
https://dl.acm.org/doi/10.5555/367072.367196
Wu YYuan XCheng DYoshida K(2000)Circuit partitioning with coupled logic restructuring techniquesProceedings of the 2000 Asia and South Pacific Design Automation Conference10.1145/368434.368862(655-660)Online publication date: 28-Jan-2000
https://dl.acm.org/doi/10.1145/368434.368862
Song JShen ZZhuang WDewilde PRammig FMusgrave G(1998)An effective general connectivity concept for clusteringProceedings of the conference on Design, automation and test in Europe10.5555/368058.368249(398-405)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368249
Liou HLin TPennino TYoffa E(1996)Area efficient pipelined pseudo-exhaustive testing with retimingProceedings of the 33rd annual Design Automation Conference10.1145/240518.240569(274-279)Online publication date: 1-Jun-1996
https://dl.acm.org/doi/10.1145/240518.240569
Cheng DLin CMarek-Sadowska MRudell R(1995)Circuit partitioning with logic perturbationProceedings of the 1995 IEEE/ACM international conference on Computer-aided design10.5555/224841.225134(650-655)Online publication date: 1-Dec-1995
https://dl.acm.org/doi/10.5555/224841.225134
Pulleyblank WLeighton FBorodin A(1995)Two Steiner tree packing problemsProceedings of the twenty-seventh annual ACM symposium on Theory of computing10.1145/225058.225163(383-387)Online publication date: 29-May-1995
https://dl.acm.org/doi/10.1145/225058.225163
Hauck SBorriello GChan PRose J(1995)Logic partition orderings for multi-FPGA systemsProceedings of the 1995 ACM third international symposium on Field-programmable gate arrays10.1145/201310.201315(32-38)Online publication date: 15-Feb-1995
https://dl.acm.org/doi/10.1145/201310.201315
Cong JLabio WShivakumar NJess JRudell R(1994)Multi-way VLSI circuit partitioning based on dual net representationProceedings of the 1994 IEEE/ACM international conference on Computer-aided design10.5555/191326.191357(56-62)Online publication date: 6-Nov-1994
https://dl.acm.org/doi/10.5555/191326.191357
Cong JLi ZBagrodia RLorenzetti M(1994)Acyclic multi-way partitioning of Boolean networksProceedings of the 31st annual Design Automation Conference10.1145/196244.196609(670-675)Online publication date: 6-Jun-1994
https://dl.acm.org/doi/10.1145/196244.196609
Liu LShih MChou NCheng CKu WLightner MJess J(1993)Performance-driven partitioning using retiming and replicationProceedings of the 1993 IEEE/ACM international conference on Computer-aided design10.5555/259794.259844(296-299)Online publication date: 7-Nov-1993
https://dl.acm.org/doi/10.5555/259794.259844
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Density-Based Probabilistic Clustering of Uncertain Data

Clustering Large Probabilistic Graphs

Probabilistic consensus clustering using evidence accumulation

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Density-Based Probabilistic Clustering of Uncertain Data

Clustering Large Probabilistic Graphs

Probabilistic consensus clustering using evidence accumulation

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations