标题: 适用于三维积体电路之线性规划
Generic Integer Linear Programming Formulation for 3D IC Partitioning
作者: 梅宗菀
Mei, Tsung-Wan
江蕙如
Jiang, Iris Hui-Ru
电子研究所
关键字: 三维积体电路切割;线性规划;3D IC partitioning;ILP
公开日期: 2010
摘要: 随着技术的发展,3D
IC渐渐成为一种趋势,但因为是一种新颖的科技,更需要新的EDA技术,而电路分割就是重要的项目其中之一。本篇论文注重在从结构层级去做电路分割,以最
大限度地发挥其效益。首先,我们使用了逻辑运算去解决三维积体电路分割的问题,并转换成ILP的方程式。我们的ILP方程式可减少TSV的数量和功耗的限
制,并且因为它的灵活性,可扩展到支持多种电源电压设计。我们更提出了两种方法去加速ILP的运算,从实验结果可以看到我们的方法能有效的降低ILP运算
时间。此外,我们的方法也有着很大的弹性空间,藉由更改或新增ILP的限制方程式,可以很容易延伸至不同目标的电路分割问题。这种灵活性使得我们的ILP
方程式可以很容易的解决一般的三维积体电路分割问题。
As
technology advances, 3D IC has gradually become a trend, because it is a
novel technology, it requires new EDA technology, and partitioning is
one of important items. This paper focus on partitioning from the
architectural level, in order to maximize its benefit. First, we use the
logical operators to solve the problem of 3D IC partitioning, and
converted into integer linear programs (ILPs). Our ILP formulation can
reduce the number of TSV and power, and because of its flexibility, it
can be expanded to support multiple supply voltage designs. We propose
two methods to speed up the ILP computation, Experimental results show
that our method can effectively reduce the ILP computation time. In
addition, our method also has great flexibility in space, by
restrictions on changes or new ILP formula can easily be extended to
different target partitioning problem. This flexibility makes the ILP
formula we can easily solve the general 3D IC partitioning problem.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079711682
http://hdl.handle.net/11536/44378
显示于类别:Thesis


文件中的档案:

  1. 168201.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.