基于社区的大规模网络社会动态模拟模型划分方法

Bonan Hou, Yiping Yao
{"title":"基于社区的大规模网络社会动态模拟模型划分方法","authors":"Bonan Hou, Yiping Yao","doi":"10.1109/DS-RT.2010.10","DOIUrl":null,"url":null,"abstract":"Efficient large-scale simulation on multiple processors is essential for social dynamics study but still has been proved to be a challenge. Community structure is a ubiquitous property of social networks. It has significant influence on its dynamics and leads the selection of model partition algorithms a critical performance issue. However, the underlying community structure is not well exploited by existing approaches of load-balancing optimizations, which discounted their effectiveness. This paper proposes COMMPAR, a community-based model partitioning approach, which utilizes the community information of social networks for performance tuning. It contains a two-phased network model partitioning as follows: first, community detection algorithm is employed to discover community structure residing in large-scale social networks, second, those communities are further equally partitioned to achieve an appropriate configuration of simulation execution, and facilitates mapping of the communities onto multiple computer processors. Eventually, the experimental results of a random-walk dynamics simulation show that COMMPAR significantly outperforms several existing partitioning approaches, and can efficiently reduce the overhead of interprocessor communications.","PeriodicalId":275623,"journal":{"name":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"CommPar: A Community-Based Model Partitioning Approach for Large-Scale Networked Social Dynamics Simulation\",\"authors\":\"Bonan Hou, Yiping Yao\",\"doi\":\"10.1109/DS-RT.2010.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient large-scale simulation on multiple processors is essential for social dynamics study but still has been proved to be a challenge. Community structure is a ubiquitous property of social networks. It has significant influence on its dynamics and leads the selection of model partition algorithms a critical performance issue. However, the underlying community structure is not well exploited by existing approaches of load-balancing optimizations, which discounted their effectiveness. This paper proposes COMMPAR, a community-based model partitioning approach, which utilizes the community information of social networks for performance tuning. It contains a two-phased network model partitioning as follows: first, community detection algorithm is employed to discover community structure residing in large-scale social networks, second, those communities are further equally partitioned to achieve an appropriate configuration of simulation execution, and facilitates mapping of the communities onto multiple computer processors. Eventually, the experimental results of a random-walk dynamics simulation show that COMMPAR significantly outperforms several existing partitioning approaches, and can efficiently reduce the overhead of interprocessor communications.\",\"PeriodicalId\":275623,\"journal\":{\"name\":\"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DS-RT.2010.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DS-RT.2010.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

高效的多处理器大规模模拟是社会动力学研究的必要条件,但也是一个挑战。社区结构是社会网络的一个普遍属性。它对模型的动态特性有重要影响,并使模型划分算法的选择成为一个关键的性能问题。然而,现有的负载平衡优化方法并没有很好地利用底层社区结构,从而降低了它们的有效性。本文提出了一种基于社区的模型划分方法COMMPAR,该方法利用社交网络的社区信息进行性能调优。它包含两阶段的网络模型划分:首先,使用社区检测算法发现存在于大规模社交网络中的社区结构,其次,对这些社区进行均匀划分,以实现适当的模拟执行配置,并便于将社区映射到多个计算机处理器上。最后,随机漫步动态仿真的实验结果表明,该算法显著优于几种现有的分区方法,并且可以有效地降低处理器间通信的开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CommPar: A Community-Based Model Partitioning Approach for Large-Scale Networked Social Dynamics Simulation
Efficient large-scale simulation on multiple processors is essential for social dynamics study but still has been proved to be a challenge. Community structure is a ubiquitous property of social networks. It has significant influence on its dynamics and leads the selection of model partition algorithms a critical performance issue. However, the underlying community structure is not well exploited by existing approaches of load-balancing optimizations, which discounted their effectiveness. This paper proposes COMMPAR, a community-based model partitioning approach, which utilizes the community information of social networks for performance tuning. It contains a two-phased network model partitioning as follows: first, community detection algorithm is employed to discover community structure residing in large-scale social networks, second, those communities are further equally partitioned to achieve an appropriate configuration of simulation execution, and facilitates mapping of the communities onto multiple computer processors. Eventually, the experimental results of a random-walk dynamics simulation show that COMMPAR significantly outperforms several existing partitioning approaches, and can efficiently reduce the overhead of interprocessor communications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信