Timing-driven system partitioning by constraints decoupling method

Proceedings 1993 IEEE Multi-Chip Module Conference MCMC-93 Pub Date : 1993-03-15 DOI:10.1109/MCMC.1993.302133

M. Shih, E. Kuh, R. Tsay

引用次数: 8

Abstract

A method called constraints decoupling for solving the MCM system partitioning problem under capacity and timing constraints is proposed. Advantage is taken of the small number of chip slots (compared to the large number of circuit components) and the problem is formulated as an integer programming problem. The dual-constraint problem is then decomposed into two independent single-constraint problems, which are much easier to solve. Experimental results indicate that all timing and capacity violations in the initial designs can be eliminated. One important application, solving practical MCM partitioning problems, is illustrated through 7 industrial examples. Extensive experiments confirmed the stability of the method.<>

查看原文本刊更多论文

基于约束解耦方法的定时驱动系统划分

针对MCM系统在容量和时间约束下的分区问题，提出了一种约束解耦方法。利用芯片插槽数量少的优势(与大量电路元件相比)，将问题表述为整数规划问题。然后将双约束问题分解为两个独立的单约束问题，求解起来容易得多。实验结果表明，初始设计中所有的时间和容量违规都可以消除。通过7个工业实例说明了解决实际MCM划分问题的一个重要应用。大量的实验证实了该方法的稳定性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings 1993 IEEE Multi-Chip Module Conference MCMC-93

自引率

0.00%

发文量