CD3D: A Constraint-driven 3-dimensional Router for Thick Film Mcms

Qiong Yu, B. Sandeep, N. Sherwani
{"title":"CD3D: A Constraint-driven 3-dimensional Router for Thick Film Mcms","authors":"Qiong Yu, B. Sandeep, N. Sherwani","doi":"10.1109/ICMCM.1994.753606","DOIUrl":null,"url":null,"abstract":"Physical design is currently a bottleneck in widespread use of MCMs. In particular, routing of a complex MCM while satisfying several performance, electrical and manufacturing constraints is a challenging problem. A router for thick film MCMs is presented in this paper. This will router partitions the whole MCM routing space into a set of small towers and decompose the routing process into three phases, viz, routing distribution, terminal assignment, and tower routing. The router has three fundamental features. First, it maintains the 3-dimensional characteristics of the original problem while partitioning it into several smaller problems and as a result, it can achieve the best utilization of the routing space. Second, it is designed to meet the constraints of net-length, path-separation, parallel-path-length, and the number of stacked vias and thus can satisfy the design requirement of high performance MCMs. Finally, the approach is amiable to parallel processing which can be used to improve the time complexity and memory constraints in a parallel computing environment. Experimental evaluation confirms the validity of our approach.","PeriodicalId":363745,"journal":{"name":"Proceedings of the International Conference on Multichip Modules","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Multichip Modules","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMCM.1994.753606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Physical design is currently a bottleneck in widespread use of MCMs. In particular, routing of a complex MCM while satisfying several performance, electrical and manufacturing constraints is a challenging problem. A router for thick film MCMs is presented in this paper. This will router partitions the whole MCM routing space into a set of small towers and decompose the routing process into three phases, viz, routing distribution, terminal assignment, and tower routing. The router has three fundamental features. First, it maintains the 3-dimensional characteristics of the original problem while partitioning it into several smaller problems and as a result, it can achieve the best utilization of the routing space. Second, it is designed to meet the constraints of net-length, path-separation, parallel-path-length, and the number of stacked vias and thus can satisfy the design requirement of high performance MCMs. Finally, the approach is amiable to parallel processing which can be used to improve the time complexity and memory constraints in a parallel computing environment. Experimental evaluation confirms the validity of our approach.
CD3D:一种约束驱动的厚膜Mcms三维路由器
物理设计目前是mcm广泛应用的瓶颈。特别是,在满足性能,电气和制造限制的情况下,复杂MCM的布线是一个具有挑战性的问题。本文介绍了一种用于厚膜mcm的路由器。这将路由器将整个MCM路由空间划分为一组小塔,并将路由过程分解为路由分配、终端分配和塔路由三个阶段。路由器有三个基本特征。首先,它在保持原问题的三维特征的同时,将原问题分解为几个较小的问题,从而实现了对路径空间的最佳利用。其次,满足净长、路径分离、平行路径长度和堆叠过孔数量的约束,满足高性能mcm的设计要求;最后,该方法易于并行处理,可用于改善并行计算环境下的时间复杂度和内存约束。实验验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信