A probabilistic multicommodity-flow solution to circuit clustering problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A probabilistic multicommodity-flow solution to circuit clustering problems

Full text

Pdf (508 KB)

Source

International Conference on Computer Aided Design archive
Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design table of contents

Santa Clara, California, United States

Pages: 428 - 431

Year of Publication: 1992

ISBN:0-89791-540-2

Authors

Ching-Wei Yeh	University of California, San Diego, La Jolla, CA
Chung-Kuan Cheng	University of California, San Diego, La Jolla, CA
Ting-Ting Y. Lin	University of California, San Diego, La Jolla, CA

Sponsors

IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 10, Citation Count: 16

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Bol85	B. Bollobas, Random Graphs, Academic Press Inc., 1985, pp.11- 12 and pp.31-53.
	Gar90	Join Garbers, "Finding Clusters in VLSI Circuits," Proc. Int. Conf. Computer-Aided Design, 1990, pp.520-523.
	Hal70	K.M. Hall, "An r-dimensional Quadratic Placement Algorithm," Management Science, vol. 17, no. 3, Nov. 1970, pp. 219-229.
	Iri67	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.
	Kan83	Sungho Kang, Linear ordering and application to placement, Proceedings of the 20th conference on Design automation, p.457-464, June 27-29, 1983, Miami Beach, Florida, United States
	Ker70	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.
	Ona71	K. onaga and O. Kakusho, "On Feasibility Conditions of Multicommodity Flows in Networks," IEEE Trans. Circuit Theory, 18(4) 1971, pp. 425-429.
	Rus71	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.
	San89	L. A. Sanchis, Multiple-Way Network Partitioning, IEEE Transactions on Computers, v.38 n.1, p.62-81, January 1989 [doi>10.1109/12.8730]
	Sch72	D. M. Schuler , E. G. Ulrich, Clustering and linear placement, Papers on Twenty-five years of electronic design automation, p.50-56, June 1988 [doi>10.1145/62882.62885]
	Sha90	Farhad Shahrokhi , D. W. Matula, The maximum concurrent flow problem, Journal of the ACM (JACM), v.37 n.2, p.318-334, April 1990 [doi>10.1145/77600.77620]
	Wei89	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.
	Wei90	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.
	Yeh91	Ching-Wei Yeh , Chung-Kuan Cheng , Ting-Ting Y. Lin, A general purpose multiple way partitioning algorithm, Proceedings of the 28th conference on ACM/IEEE design automation, p.421-426, June 17-22, 1991, San Francisco, California, United States [doi>10.1145/127601.127706]

CITED BY 16

	William R. Pulleyblank, Two Steiner tree packing problems, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.383-387, May 29-June 01, 1995, Las Vegas, Nevada, United States
	C. J. Alpert , A. B. Kahng, Geometric embeddings for faster and better multi-way netlist partitioning, Proceedings of the 30th international conference on Design automation, p.743-748, June 14-18, 1993, Dallas, Texas, United States
	Wern-Jieh Sun , Carl Sechen, Efficient and effective placement for very large circuits, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.170-177, November 07-11, 1993, Santa Clara, California, United States
	Yu-Liang Wu , Xiao-Long Yuan , David Ihsin Cheng, Circuit partitioning with coupled logic restructuring techniques, Proceedings of the 2000 conference on Asia South Pacific design automation, p.655-660, January 2000, Yokohama, Japan
	Pak K. Chan , Martine D. F. Schlag , Jason Y. Zien, Spectral K-way ratio-cut partitioning and clustering, Proceedings of the 30th international conference on Design automation, p.749-754, June 14-18, 1993, Dallas, Texas, United States
	C. Cheung , Y. Wu , D. Cheng, Further improve circuit partitioning using GBAW logic perturbation techniques, Proceedings of the conference on Design, automation and test in Europe, p.233-239, March 2001, Munich, Germany
	Lung-Tien Liu , Minshine Shih , Nan-Chi Chou , Chung-Kuan Cheng , Walter Ku, Performance-driven partitioning using retiming and replication, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.296-299, November 07-11, 1993, Santa Clara, California, United States
	David Ihsin Cheng , Chih-Chang Lin , Malgorzata Marek-Sadowska, Circuit partitioning with logic perturbation, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.650-655, November 05-09, 1995, San Jose, California, United States
	Jason Cong , Zheng Li , Rajive Bagrodia, Acyclic multi-way partitioning of Boolean networks, Proceedings of the 31st annual conference on Design automation, p.670-675, June 06-10, 1994, San Diego, California, United States
	J. Song , Z. Shen , W. Zhuang, An effective general connectivity concept for clustering, Proceedings of the conference on Design, automation and test in Europe, p.398-405, February 23-26, 1998, Le Palais des Congrés de Paris, France
	Kalapi Roy , Carl Sechen, A timing driven N-way chip and multi-chip partitioner, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.240-247, November 07-11, 1993, Santa Clara, California, United States
	Scott Hauck , Gaetano Borriello, Logic partition orderings for multi-FPGA systems, Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays, p.32-38, February 12-14, 1995, Monterey, California, United States
	Huoy-Yu Liou , Ting-Ting Y. Lin, Area efficient pipelined pseudo-exhaustive testing with retiming, Proceedings of the 33rd annual conference on Design automation, p.274-279, June 03-07, 1996, Las Vegas, Nevada, United States
	Jason Cong , Wilburt Labio , Narayanan Shivakumar, Multi-way VLSI circuit partitioning based on dual net representation, Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, p.56-62, November 06-10, 1994, San Jose, California, United States
	Tom Leighton , Satish Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, Journal of the ACM (JACM), v.46 n.6, p.787-832, Nov. 1999
	Ting-Ting Lin , Huoy-Yu Liou, A New Framework for Designing: Built-in Test Multichip Modules with Pipelined Test Strategy, IEEE Design & Test, v.10 n.4, p.38-51, October 1993