A lock-free multi-threaded algorithm for the maximum flow problem

  title={A lock-free multi-threaded algorithm for the maximum flow problem},
  author={Bo Hong},
  journal={2008 IEEE International Symposium on Parallel and Distributed Processing},
  • Bo Hong
  • Published 2008
  • Computer Science
  • 2008 IEEE International Symposium on Parallel and Distributed Processing
The maximum flow problem is an important graph problem with a wide range of applications. In this paper, we present a lock-free multi-threaded algorithm for this problem. The algorithm is based on the push-relabel algorithm proposed by Goldberg. By using re-designed push and relabel operations, we derive our algorithm that finds the maxi- mumflow with 0{\V\2 \E\) operations. We demonstrate that as long as a multi-processor architecture supports atomic 'read-update-write' operations, it will be… Expand
An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic
  • Bo Hong, Zhengyu He
  • Computer Science
  • IEEE Transactions on Parallel and Distributed Systems
  • 2011
Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms
  • Zhengyu He, Bo Hong
  • Computer Science
  • 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
  • 2010
A Hybrid Parallel Implementation for the Maximum Flow Problem
  • M. Stefanes, Luiz Fernando Alvino
  • Computer Science
  • 2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)
  • 2018
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
Algorithm 1002
Sequential and Parallel Algorithm by Postflow-Pull Methods to Find Maximum Flow
Parallel implematation of flow and matching algorithms
Optimal bandwidth allocation for hybrid Video-on-Demand streaming with a distributed max flow algorithm


On the parallel implementation of Goldberg's maximum flow algorithm
An O(n² log n) Parallel MAX-FLOW Algorithm
A new approach to the maximum flow problem
An Introduction to Parallel Algorithms
How to Make a Correct Multiprocess Program Execute Correctly on a Multiprocessor
  • L. Lamport
  • Computer Science
  • IEEE Trans. Computers
  • 1997
Finding Minimum-Cost Circulations by Successive Approximation
Parallelism in random access machines
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Scaling algorithms for network problems
  • H. Gabow
  • Computer Science, Mathematics
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983