提出了在精确时延模型下 ,满足时延约束的缓冲器数目最小化的算法 .给出一个两端线网 ,该算法可以求出满足时延约束的最小缓冲器数目 .运用高阶时延模型计算互连线的时延 ,运用基于查找表的非线性时延模型计算缓冲器的时延 .实验结果证明此算法有效地优化了缓冲器插入数目和线网的时延 ,在二者之间取得了较好的折中 .算法的运行时间也是令人满意的 An algorithm is proposed to minimize the number of buffers that satisfy the delay constraint under the exact delay model. A two-end net is given, which can find the minimum number of buffers that satisfy the delay constraint. The delay of the interconnection is calculated and the delay of the buffer is calculated by using the non-linear delay model based on look-up table.The experimental results show that this algorithm effectively optimizes the number of buffer insertions and the delay of the network, Achieved a good compromise.The running time of the algorithm is also satisfactory