Parallel simulation of scale-free networks
Institution: | Georgia Tech |
---|---|
Department: | |
Year: | 2017 |
Keywords: | Simulation; Parallel discrete event simulation; High performance computing |
Posted: | 02/01/2018 |
Record ID: | 2211835 |
Full text PDF: | http://hdl.handle.net/1853/58626 |
It has been observed that many networks arising in practice have skewed node degree distributions. Scale-free networks are one well-known class of such networks. Achieving efficient parallel simulation of scale-free networks is challenging because large-degree nodes can create bottlenecks that limit performance. To help address this problem, we describe an approach called link partitioning where each network link is mapped to a logical process in contrast to the conventional approach of mapping each node to a logical process.Advisors/Committee Members: Fujimoto, Richard M. (advisor), Vuduc, Ricahrd (committee member), Swenson, Brian (committee member).