A Timing－Driven Placement Algorithm Based on Solving Allocation Problem

彭宇行; 陈福接; 陈书明

您当前的位置：

首页 >

文章列表页 >

A Timing－Driven Placement Algorithm Based on Solving Allocation Problem

更新时间：2025-12-08

- A Timing－Driven Placement Algorithm Based on Solving Allocation Problem
- Acta Electronica Sinica Issue 2, (1997)
- 作者机构：
  
  国防科技大学计算机研究所
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN402
- Published：1997
- 稿件说明：
移动端阅览
[1]彭宇行,陈福接,陈书明.用解定位问题求延时优化驱动布局[J].电子学报,1997(02):110-112.

彭宇行, 陈福接, 陈书明. A Timing－Driven Placement Algorithm Based on Solving Allocation Problem[J]. Acta Electronica Sinica, 1997, (2).
[1]彭宇行,陈福接,陈书明.用解定位问题求延时优化驱动布局[J].电子学报,1997(02):110-112. DOI：

彭宇行, 陈福接, 陈书明. A Timing－Driven Placement Algorithm Based on Solving Allocation Problem[J]. Acta Electronica Sinica, 1997, (2). DOI：

摘要

延时优化驱动布局是为提高ＩＣ性能最早进行研究的课题之一，但目前的算法存在运算速度慢，设计结果欠佳等缺点．本文基于解定位问题，将布局过程分为初始定位、再定位和消除重选三个阶段．实验结果表明，它不仅布局速度快，而且能减小ＩＣ延时．

Abstract

Timing-driven placement is the earliest approach to improve IC performance.However

the present algorithms run slowly and the designs are dissatisfactory. This paper

based on solving allocation problem

presents a placement algorithm that consists of initial placement

replacement and deleting overlapping. The experiment result shows that our algorithm runs fast and can reduce the IC delay.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Technology Mapping Algorithm for Area Optimization under Delay Constraint

Review on Technology of Placement and Routing for the FPGA

Related Author

陈福接

彭宇行

陈福接

陈书明

彭宇行

ZHOU Chong

PANG Yong-jing

ZHANG Yao-wei

Related Institution

Department of Computer,Changsha Institute of Technology

P&DP Lab. National University of Defense Technology

410073

Beijing Microelectronics Technology Institute

Department of Micro/nanoelectronics, School of Electronics Engineering and Computer Science, Peking University

⁰