Maximum crossing number algorithm on linear array with a reconfigurable pipelined bus system

ACM-SE 35 Pub Date : 1997-04-02 DOI:10.1145/2817460.2817475
H. Kimm
{"title":"Maximum crossing number algorithm on linear array with a reconfigurable pipelined bus system","authors":"H. Kimm","doi":"10.1145/2817460.2817475","DOIUrl":null,"url":null,"abstract":"In the channel routing problem, terminals between cells are interconnected completely while reducing channel routing area. The crossing number, the number of crossings between two wires in the channel, is related to the channel routing area. In this paper, we present a parallel algorithm finding a maximum crossing number, density, in the channel by using a LARPBS model (Linear Array with a Reconfigurable Pipelined Bus System), which is based on the advanced fiber optic technology. The maximum crossing number algorithm on the LARPBS model runs in O(n) time using O(n) number of processors, where n is the number of nets in a channel.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 35","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2817460.2817475","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the channel routing problem, terminals between cells are interconnected completely while reducing channel routing area. The crossing number, the number of crossings between two wires in the channel, is related to the channel routing area. In this paper, we present a parallel algorithm finding a maximum crossing number, density, in the channel by using a LARPBS model (Linear Array with a Reconfigurable Pipelined Bus System), which is based on the advanced fiber optic technology. The maximum crossing number algorithm on the LARPBS model runs in O(n) time using O(n) number of processors, where n is the number of nets in a channel.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有可重构流水线系统的线性阵列上的最大交叉数算法
在信道路由问题中,在减少信道路由面积的同时,使小区间的终端完全互连。交叉数,即通道中两根导线之间的交叉数,与通道路由面积有关。在本文中,我们提出了一种基于先进光纤技术的并行算法,利用LARPBS模型(线性阵列与可重构流水线总线系统)在通道中寻找最大交叉数和密度。LARPBS模型上的最大交叉数算法使用O(n)个处理器在O(n)个时间内运行,其中n是通道中的网数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improving the identification of verbs Constructing Delaunay triangulation on the Intel Paragon Software agents and the role of market protocols Interactive Petri net simulation Hybrid evolutionary path planning via visibility-based repair
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1