Implementation of random walk algorithm by parallel computing

J. Cui, Jun Guo, Cangsong Zhang, Xiaojun Chang
{"title":"Implementation of random walk algorithm by parallel computing","authors":"J. Cui, Jun Guo, Cangsong Zhang, Xiaojun Chang","doi":"10.1109/FSKD.2012.6233917","DOIUrl":null,"url":null,"abstract":"The basic concepts of random walk problem were introduced firstly. And then, the theoretical method for analyzing the large scale integrated circuit with random walk algorithm was discussed in detail. By analyzing the parallel features of random walk algorithm, the parallel computing technology was proposed to improve the efficiency of random walk algorithm. Time complexity and the main factors impacting the execution time of algorithm were analyzed as well. The experimental results show that the parallel random walk algorithm is an effective method to solve a large scale P/G network with less PAD nodes.","PeriodicalId":337941,"journal":{"name":"International Conference on Fuzzy Systems and Knowledge Discovery","volume":"462 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Fuzzy Systems and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2012.6233917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The basic concepts of random walk problem were introduced firstly. And then, the theoretical method for analyzing the large scale integrated circuit with random walk algorithm was discussed in detail. By analyzing the parallel features of random walk algorithm, the parallel computing technology was proposed to improve the efficiency of random walk algorithm. Time complexity and the main factors impacting the execution time of algorithm were analyzed as well. The experimental results show that the parallel random walk algorithm is an effective method to solve a large scale P/G network with less PAD nodes.
用并行计算实现随机漫步算法
首先介绍了随机漫步问题的基本概念。然后,详细讨论了用随机漫步算法分析大规模集成电路的理论方法。通过分析随机漫步算法的并行特性,提出了并行计算技术来提高随机漫步算法的效率。分析了时间复杂度和影响算法执行时间的主要因素。实验结果表明,并行随机漫步算法是解决PAD节点较少的大规模P/G网络的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信