RANDOMIZED OPTIMAL LIST RANKING ON COARSE-GRAINED PARALLEL COMPUTERS WITH O(log p) COMMUNICATION PHASES

Xiaotie Deng, Patrick W. Dymond
{"title":"RANDOMIZED OPTIMAL LIST RANKING ON COARSE-GRAINED PARALLEL COMPUTERS WITH O(log p) COMMUNICATION PHASES","authors":"Xiaotie Deng, Patrick W. Dymond","doi":"10.1080/10637199808947384","DOIUrl":null,"url":null,"abstract":"The cost of interprocessor communication has a substantial impact on execution time when implementing parallel algorithms on physical parallel computers. For coarse-grained parallel computers it is important to minimize the number of communication phases, in order to balance cost of communication with local computation time. We present a log p-phase optimal randomized parallel list ranking algorithm and its application to expression evaluation. These techniques address the general issue of model-independent parallel algorithm design.","PeriodicalId":406098,"journal":{"name":"Parallel Algorithms and Applications","volume":"81 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10637199808947384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The cost of interprocessor communication has a substantial impact on execution time when implementing parallel algorithms on physical parallel computers. For coarse-grained parallel computers it is important to minimize the number of communication phases, in order to balance cost of communication with local computation time. We present a log p-phase optimal randomized parallel list ranking algorithm and its application to expression evaluation. These techniques address the general issue of model-independent parallel algorithm design.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有0 (log p)通信阶段的粗粒度并行计算机上的随机最优列表排序
在物理并行计算机上实现并行算法时,处理器间通信的成本对执行时间有很大的影响。对于粗粒度并行计算机,为了平衡通信开销和局部计算时间,最小化通信阶段数是非常重要的。提出了一种对数p期最优随机并行列表排序算法及其在表达式评价中的应用。这些技术解决了与模型无关的并行算法设计的一般问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses A comparative study of explicit group iterative solvers on a cluster of workstations FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture Application of MPI-IO in Parallel Particle Transport Monte-Carlo Simulation Cost-effective modeling for natural resource distribution systems
×
引用
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