ACM Home Page
Please provide us with feedback. Feedback
Performance driven multi-level and multiway partitioning with retiming
Full text PdfPdf (240 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 37th Annual Design Automation Conference table of contents
Los Angeles, California, United States
Pages: 274 - 279  
Year of Publication: 2000
ISBN:1-58113-187-9
Authors
Jason Cong  UCLA Department of Computer Science, Los Angeles, CA
Sung Kyu Lim  UCLA Department of Computer Science, Los Angeles, CA
Chang Wu  Aplus Design Technologies, Inc., Los Angeles, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 18,   Citation Count: 18
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/337292.337418
What is a DOI?

ABSTRACT

In this paper, we study the performance driven multiw ay circuit partitioning problem with consideration of the significant difference of local and global interconnect delay induced by the partitioning. We develop an efficient algorithm HPM (Hierarc hicalP erformance driven Multi-level partitioning) that simultaneously considers cutsize and delay minimization with retiming. HPM builds a multi-lev el cluster hierarc hy and performs various refinement while gradually decomposing the clusters for simultaneous cutsize and delay minimization. We provide comprehensive experimental justification for each step involv ed in HPM and in-depth analysis of cutsize and delay tradeoff existing in the performance driven partitioning problem. HPM obtains (i) 7% to 23% better delay compared to the state-of-the-art cutsize driven hMetis [11] at the expense of 19% increase in cutsize, and (ii) 81% better cutsize compared to the state-of-the-art delay driven PRIME [2] at the expense of 6% increase in delay.


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.

 
1
J. Cong. An interconnect-centric design flow for nanometer technologies. In Proc. of Int'l Symp. on VLSI Technology, Systems, and Applications, pages 54- 57, 1999.
2
 
3
4
5
6
 
7
J. Cong, S. K. Lira, and C. Wu. Performance-driven multi-level and multi-way partitioning. Technical Report 990046, UCLA CS Dept, Oct. 1999.
8
 
9
 
10
J. Hwang and A. E1 Gamal. Min-cut replication in partitioned networks. IEEE Trans. on Computer-Aided Design, pages 96-106, 1995.
11
 
12
E. L. Lawler, K. N. Levitt, and J. Turner. Module clustering to minimize delay in digital networks. IEEE Trans. on Computer-Aided Design, pages 47-57, 1969.
 
13
C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry. Algorithmica, pages 5-35, 1991.
 
14
L. Liu, M. Kuo, C. K. Cheng, and T. C. Hu. Performance driven partitioning using a replication graph approach. In Proc. A CM Design Automation Conf., pages 206-210, 1995.
 
15
 
16
R. Murgai, R. K. Brayton, and A. Sangiovanni Vincentelli. On clustering for minimum delay/area. In Proc. Int. Conf. on Computer-Aided Design, pages 6-9, 1991.
 
17
P. Pan, A. K. Karandikar, and C. L. Liu. Optimal clock period clustering for sequential circuits with retiming. IEEE Trans. on Computer-Aided Design, pages 489- 498, 1998.
18
 
19
 
20

CITED BY  18

Collaborative Colleagues:
Jason Cong: colleagues
Sung Kyu Lim: colleagues
Chang Wu: colleagues