| Autor: |
Imanaga, Tomohiro, Nakano, Koji, Yasudo, Ryota, Ito, Yasuaki, Kawamata, Yuya, Katsuki, Ryota, Tabata, Yusuke, Yazane, Takashi, Hamano, Kenichiro |
| Předmět: |
|
| Zdroj: |
Concurrency & Computation: Practice & Experience; 6/25/2023, Vol. 35 Issue 14, p1-22, 22p |
| Abstrakt: |
An independent set of a graph is a subset of the nodes such that no two nodes in it are adjacent. The maximum independent set (MIS) problem is an optimization problem to find a largest independent set. The main contribution of this article is to introduce a generic iterative trial search algorithm that we call iMIS for finding approximate solutions for the MIS problem. The generic algorithm iMIS is designed so that it can be implemented to run on GPUs very efficiently. Since the performance of the algorithm varies depending on its search strategy, we present a hybrid algorithm that combines three strategies of the iMIS such that best one of them for an input graph is automatically selected. We have implemented our hybrid algorithm to run on a multi‐GPU server with eight NVIDIA A100 GPUs. And evaluated the performance for 66 DIMACS benchmark graphs and 78 random graphs with up to 256M nodes. We have also evaluated the performance of three previously published algorithms for the MIS problem and an approach using Gurobi linear programming solver. The experimental results show that our hybrid algorithm can find larger independent sets for all 144 graphs compared to other methods. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Plný text