位置:成果数据库 > 期刊 > 期刊详情页
面向非一致Cache的智能多跳提升技术
  • ISSN号:0254-4164
  • 期刊名称:《计算机学报》
  • 时间:0
  • 分类:TP391.41[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术] TP311.13[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]National Laboratory for Parallel and Distributed Processing, School of Computers, National University of Defense Technology, Changsha 410073, China, [2]Department of Computer Science and Technology, School of Computers, National University of Defense Technology, Changsha 410073, China
  • 相关基金:Project supported by the National Science Foundation for Distinguished Young Scholars of China (Grant Nos. 61003082 and 60903059);the National Natural Science Foundation of China (Grant No. 60873014) and the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (Grant No. 60921062).
中文摘要:

<正>Many real-world networks are found to be scale-free.However,graph partition technology,as a technology capable of parallel computing,performs poorly when scale-free graphs are provided.The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks,rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively.In this paper,we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm,top down partitioning,which derives its name from the comparison with the traditional bottom-up partitioning.A new multilevel partitioning algorithm,named betweenness-based partitioning algorithm,is also presented as an implementation of top-down partitioning paradigm.An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches.

英文摘要:

Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom-up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top-down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches.

同期刊论文项目
期刊论文 72 会议论文 39 获奖 3
期刊论文 25 会议论文 11 专利 1
同项目期刊论文
期刊信息
  • 《计算机学报》
  • 北大核心期刊(2011版)
  • 主管单位:中国科学院
  • 主办单位:中国计算机学会 中国科学院计算技术研究所
  • 主编:孙凝晖
  • 地址:北京中关村科学院南路6号
  • 邮编:100190
  • 邮箱:cjc@ict.ac.cn
  • 电话:010-62620695
  • 国际标准刊号:ISSN:0254-4164
  • 国内统一刊号:ISSN:11-1826/TP
  • 邮发代号:2-833
  • 获奖情况:
  • 中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 美国数学评论(网络版),荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:48433