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

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 d...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE International Symposium on Parallel and Distributed Processing s. 1 - 8
Hlavní autor: Bo Hong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2008
Témata:
Algorithm design and analysis
Computer architecture
Concurrent computing
Multicore processing
Parallel algorithms
Parallel processing
Phase change random access memory
Routing
Very large scale integration
Yarn
ISBN:1424416930, 9781424416936
ISSN:1530-2075
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í: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 able to execute the multi-threaded algorithm free of any lock usages. The proposed algorithm is expected to significantly improve the efficiency of solving maximum flow problem on parallel/multi-core architectures.
ISBN:1424416930
9781424416936
ISSN:1530-2075
DOI:10.1109/IPDPS.2008.4536352