课题基金 / 基金详情

Nonlinear-Programming Based Algorithms for Constrained Circuit Placement

Nonlinear-Programming Based Algorithms for Constrained Circuit Placement
基于非线性规划的约束电路布局算法
批准号:
9901153
负责人:
Jason Cong
金额:
$8.5万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1999
资助国家:
美国
项目状态:
已结题
起止时间:
1999-02-15 至 2002-01-31

项目摘要

项目成果

Jason Cong的其他基金

相似基金

相关文献

中文摘要
翻译
本研究探讨新的,高效的,高度优化的解决方案,以大规模IC布局在严格的时间限制。本计画的重点是探讨应用最近发展的数值演算法的可行性,例如大规模粒子模拟的快速多极子方法和非线性规划的邻近点法,来解决大规模的限制性电路布局问题。该项目的主要研究内容包括:(一)在数学规划公式中直接处理时间和非重叠约束;(二)问题的分层模型,允许对非光滑和离散约束进行光滑近似;(三)快速多极展开,以加速对约束及其衍生物的评估;(iv)对用于计算优化中的搜索方向的基于KKT的线性方程组的快速数值解。
英文摘要
This research investigates new, efficient, and highly optimized solutions to large-scale IC placement under tight timing constraints. The focus of this project is to investigate the feasibility of applying recentlydeveloped numerical algorithms, such as the fast multipole method for large-scale particle simulation and the interior-point method for non-linear programming to solving the large-scale constrained circuitplacement problem. Key elements of studies in this project include (i) direct handling of timing and non-overlapping constraints in a mathematical programming formulation; (ii) an hierarchical model of the problem allowing smooth approximations to non-smooth and discrete constraints; (iii) fast multipole expansions to accelerate evaluation of the constraints and their derivatives; (iv) fast numerical solution to KKT-based systems of linear equations used to calculate search directions in the optimization.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Collaborative Research: FET: Medium: Efficient Compilation for Dynamically Reconfigurable Atom Arrays
SHF: Medium: Automating High Level Synthesis via Graph-Centric Deep Learning
RTML: Large: Acceleration to Graph-Based Machine Learning
CAPA: Collaborative Research: A Multi-Paradigm Programming Infrastructure for Heterogeneous Architectures
海外基金