Accelerating domain propagation: An efficient GPU-parallel algorithm over sparse matrices

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

Full description

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 109; p. 102874
Main Authors: Sofranac, Boro, Gleixner, Ambros, Pokutta, Sebastian
Format: Journal Article
Language:English
Published: Elsevier B.V 01.03.2022
Subjects:
Bound tightening
Domain propagation
GPU
MIP
Mixed integer linear programming
Parallel algorithms
Mixed integer linear programming
MIP
GPU
Parallel algorithms
Domain propagation
Bound tightening
ISSN:0167-8191, 1872-7336
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•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.
ISSN:0167-8191
1872-7336
DOI:10.1016/j.parco.2021.102874