Parallel Neighborhood Expansion Based Graph Edge Partitioning Algorithm

This paper proposes a novel parallel neighborhood expansion-based algorithm for graph edge partitioning aimed at addressing computational efficiency and scalability issues in large-scale graph data processing. The algorithm employs innovative parallel strategies and load balancing techniques, effect...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE International Conference on Power, Intelligent Computing and Systems (Online) S. 1583 - 1587
Hauptverfasser:	Huang, Jijie, Chen, Yang
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 26.07.2024
Schlagworte:	Computational efficiency Data processing Distance measurement graph edge partitioning high-performance computing large-scale graph processing load balancing Load management Memory management parallel algorithm Partitioning algorithms Scalability Social networking (online)
ISSN:	2834-8567
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!