A Shared-Memory Algorithm for Updating Tree-Based Properties of Large Dynamic Networks

This paper presents a network-based template for analyzing large-scale dynamic data. Specifically, we propose a novel shared-memory parallel algorithm for updating tree-based structures or properties, such as connected components (CC) and minimum spanning trees (MST), on dynamic networks. The underl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on big data Ročník 8; číslo 2; s. 302 - 317
Hlavní autoři: Srinivasan, Sriram, Pollard, Samuel D., Norris, Boyana, Das, Sajal K., Bhowmick, Sanjukta
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.04.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Big Data
connected components
Data structures
Dynamic networks
Graph theory
Heuristic algorithms
Image edge detection
Maintenance engineering
minimum spanning tree
Networks
Parallel algorithms
Partitioning algorithms
shared memory algorithms
ISSN:2332-7790, 2372-2096
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a network-based template for analyzing large-scale dynamic data. Specifically, we propose a novel shared-memory parallel algorithm for updating tree-based structures or properties, such as connected components (CC) and minimum spanning trees (MST), on dynamic networks. The underlying idea is to update the information in a rooted tree data structure that stores the edges of the network that are most relevant to the analysis. Extensive experiments on real-world and synthetic networks demonstrate that, with the exception of the inherently sequential component for creating the rooted tree, our proposed updatiing algorithm is scalable and, in most cases, also requires significantly less memory, energy, and time than recomputing-from-scratch algorithm. To the best of our knowledge, this is the first parallel algorithm for updating MST on weighted dynamic networks. The rooted-tree based framework that we propose in this paper can be extended for updating other weighted and unweighted tree-based properties such as single source shortest path and betweenness and closeness centrality.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2332-7790
2372-2096
DOI:10.1109/TBDATA.2018.2870136