期刊文献+

基于GPU的大尺度网络零模型分组生成并行算法 被引量:3

GPU-based parallel algorithm for partitionedly generating null model of large-scale networks
下载PDF
导出
摘要 为解决生成大尺度网络的零模型时间效率较低的问题,利用数据分组思想,针对生成0阶、1阶、2阶网络零模型的随机置乱算法提出基于GPU的并行化实现。并行化过程中,设计不重复分配原则,以及存在性替换、重复性替换策略避免无效置乱。基于常用的网络拓扑指标以及网络随机化程度,验证并行算法的有效性,验证结果表明,并行的分组置乱算法相比传统的串行算法提高了时间效率,针对GPU显存无法一次性容纳的大尺度网络,能快速生成其相应的零模型,为大尺度网络零模型的研究提供了一种高效的解决方案。 To solve the problem of low time efficiency of generating null model for large scale networks,the random permutation algorithms for partitionedly generating null model of 0order,1order and 2order were parallelly implemented on GPU.The principle of unique distribution,the strategies of replacement on existence and duplication were designed to avoid invalid permutations.In terms of some commonly used network topology metrics and degree of randomization,the effectiveness of the parallel algorithms was verified.The experimental results show that,the parallel algorithms on GPU greatly improve time efficiency compared to serial ones.By using the parallel algorithms proposed,null models for large scale networks that can not be wholly loaded to GPU can be generated fast.In this way,an efficient solution for research on null models of large scale networks is proposed.
出处 《计算机工程与设计》 北大核心 2016年第1期93-99,共7页 Computer Engineering and Design
基金 北京高等学校青年英才计划基金项目(YETP0506)
关键词 复杂网络 零模型 随机置乱 图形处理单元 并行计算 complex networks null model random permutations GPU parallel computing
  • 相关文献

参考文献13

二级参考文献206

  • 1张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,15(8):1220-1226. 被引量:64
  • 2张国强,张国清.基于回溯机制的互联网AS拓扑的Betweenness算法[J].计算机研究与发展,2006,43(10):1790-1796. 被引量:7
  • 3Faloutsos M,Faloutsos P,Faloutsos C.On power-law relationships of the Internet topology[J].ACM SIGCOMM Computer Communication Review,1999,29(4):251-262.
  • 4Zhang Guoqing,Zhang Guoqiang,et al.Evolution of the Internet and its cores[J].New Journal of Physics,2008,10:123027.
  • 5Priya M,Dmitri K,et al.Systematic topology analysis and generation using degree correlations[C] //Proc of ACM SIGCOMM 2006.New York:ACM,2006:135-146.
  • 6Mahadevan P,Hubble C,et al.Orbis:Rescaling degree correlations to generate annotated internet topologies[C] //Proc of ACM SIGCOMM 2007.New York:ACM,2007:325-336.
  • 7Gao Lixin.On inferring autonomous system relationships in the Internet[J].IEEE//ACM Trans on Networking,2001,9(6):733-745.
  • 8Mao Z,Qiu L,Wang J,et al.On as-level path inference[C] //Proc of SIGMETRICS'05.New York:ACM,2005:339-349.
  • 9Mühlbauer W,Uhlig S,et al.In search for an appropriate granularity to model routing policies[C] //Proc of ACM SIGCOMM 2007.New York:ACM,2007:145-156.
  • 10Cohen R,Raz D.Acyclic type of relationships between autonomous systems[C] //Proc of INFOCOM 2007.Piscataway,NJ:IEEE,2007:1334-1342.

共引文献79

同被引文献21

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部