Parallel simulation of scale-free networks

Thumbnail Image
Files
NGUYEN-THESIS-2017.pdf (1.77 MB)
Author(s)
Nguyen, Thuy Vy Thuy
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
School of Computational Science and Engineering
School established in May 2010
Series
Collections
Theses and Dissertations
Supplementary to:
Permanent Link
http://hdl.handle.net/1853/58626
Abstract
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.
Sponsor
Date
2017-08-01
Extent
Resource Type
Text
Resource Subtype
Thesis
Rights Statement
Rights URI