Back to search

Georgia Institute of Technology

Parallel simulation of scale-free networks

Abstract

dc:description.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.

Degree

thesis:*
Level thesis:degree_level
Masters
Department dc:contributor.department
Computational Science and Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Nguyen, Thuy Vy Thuy
Advisor dc:contributor.advisor
  • Fujimoto, Richard M.
Committee members dc:contributor.committeemember
  • Vuduc, Richard
  • Swenson, Brian

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/58626

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Nguyen, Thuy Vy Thuy. Parallel simulation of scale-free networks. Masters thesis, Georgia Institute of Technology, 2017. http://hdl.handle.net/1853/58626