Fast parallel selection on the linear array with reconfigurable pipelined bus system

Yijie Han, Y. Pan, Hong Shen
{"title":"Fast parallel selection on the linear array with reconfigurable pipelined bus system","authors":"Yijie Han, Y. Pan, Hong Shen","doi":"10.1109/FMPC.1999.750611","DOIUrl":null,"url":null,"abstract":"The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model based on current optical bus technology. We show that the selection problem can be solved on the LARPBS model in O((log log N)/sup 2//log log log N) bus cycles deterministically. To our best knowledge, this is the best deterministic selection algorithm on the LARPBS model.","PeriodicalId":405655,"journal":{"name":"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1999.750611","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The Linear Array with a Reconfigurable Pipelined Bus System (LARPBS) is a newly introduced parallel computational model based on current optical bus technology. We show that the selection problem can be solved on the LARPBS model in O((log log N)/sup 2//log log log N) bus cycles deterministically. To our best knowledge, this is the best deterministic selection algorithm on the LARPBS model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于可重构流水线系统的线性阵列快速并行选择
线性阵列与可重构流水线总线系统(LARPBS)是一种基于当前光总线技术的新型并行计算模型。我们证明了LARPBS模型可以在O((log log N)/sup 2//log log log N)个总线周期内确定性地解决选择问题。据我们所知,这是LARPBS模型上最好的确定性选择算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Token space minimization by simulated annealing Fast parallel selection on the linear array with reconfigurable pipelined bus system Packing/unpacking information generation for efficient generalized kr/spl rarr/r and r/spl rarr/kr array redistribution Latency tolerant algorithms for WAN based workstation clusters New algorithms for efficient mining of association rules
×
引用
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