High-Quality Shared-Memory Graph Partitioning

Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partit...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 31; číslo 11; s. 2710 - 2722
Hlavní autoři:	Akhremtsev, Yaroslav, Sanders, Peter, Schulz, Christian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.11.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Balance criterion Clustering algorithms Complex networks Contracts Graphs label propagation local search Parallel algorithms Parallel graph partitioning Partitioning Partitioning algorithms Program processors shared-memory parallelism
ISSN:	1045-9219, 1558-2183
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!