.png){kind=icon}
返回
An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2010.156.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a novel asynchronous multithreaded algorithm for the maximum network flow problem. The algorithm is based on the classical push-relabel algorithm, which is essentially sequential and requires intensive and costly lock usages to parallelize it. The novelty of the algorithm is in the removal of lock and barrier usages, thereby enabling a much more efficient multithreaded implementation. The newly designed push and relabel operations are executed completely asynchronously and each individual process/thread independently decides when to terminate itself. We further propose an asynchronous global relabeling heuristic to speed up the algorithm. We prove that our algorithm finds a maximum flow with O(vertical bar V vertical bar(2) vertical bar vertical bar E vertical bar) operations, where vertical bar V vertical bar is the number of vertices and vertical bar E vertical bar is the number of edges in the graph. We also prove the correctness of the relabeling heuristic. Extensive experiments show that our algorithm exhibits better scalability and faster execution speed than the lock-based parallel push-relabel algorithm.
Keyword:
Maximum network flow
parallel algorithm
multithreading
lock-free
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
分享收藏Mechanical Properties of Fibre Reinforced Polymers under Elevated Temperatures: An Overview.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏Burkholderia cenocepacia Type VI Secretion System Mediates Escape of Type II Secreted Proteins into the Cytoplasm of Infected MacrophagesPLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容