TY  - JOUR
A1  - Šofranac, Boro
A1  - Gleixner, Ambros
A1  - Pokutta, Sebastian
T1  - Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices
T2  - Parallel Computing
N2  - • Currently, domain propagation in state-of-the-art MIP solvers is single thread only.
• The paper presents a novel, efficient GPU algorithm to perform domain propagation.
• Challenges are dynamic algorithmic behavior, dependency structures, sparsity patterns.
• The algorithm is capable of running entirely on the GPU with no CPU involvement.
• We achieve speed-ups of around 10x to 20x, up to 180x on favorably-large instances.
Y1  - 2021
UR  - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/8549
VL  - 109
SP  - 102874
ER  -