Generating Massive Scale-free Networks
Abstract
Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- May 18, 2020
- Source ID
- 10.1145/3391446
Entities
People
- Kalyan S. Perumalla
- Madhav Marathe
- Maksudul Alam
- Maleq Khan
Organizations
- Defense Threat Reduction Agency
- Oak Ridge National Laboratory
- University of Virginia