GPU-Based Heuristic Solver for Linear Sum Assignment Problems Under Real-time Constraints
Roberto Roverso, Amgad Naiem, Mohammed El-Beltagy, Sameh El-Ansary

TL;DR
This paper presents a GPU-accelerated heuristic algorithm for the Linear Sum Assignment Problem, enabling near real-time solutions in large-scale, industrial P2P streaming scenarios, with significant performance improvements over traditional methods.
Contribution
The paper introduces a parallel GPU implementation of the Deep Greedy Switching heuristic for LSAP, including practical insights and performance comparisons with existing algorithms.
Findings
GPU-based DGS achieves faster solutions than CPU-based DGS.
Parallel GPU auction algorithm is outperformed by the proposed DGS approach.
Method is applicable to large-scale, real-time assignment problems.
Abstract
In this paper we modify a fast heuristic solver for the Linear Sum Assignment Problem (LSAP) for use on Graphical Processing Units (GPUs). The motivating scenario is an industrial application for P2P live streaming that is moderated by a central node which is periodically solving LSAP instances for assigning peers to one another. The central node needs to handle LSAP instances involving thousands of peers in as near to real-time as possible. Our findings are generic enough to be applied in other contexts. Our main result is a parallel version of a heuristic algorithm called Deep Greedy Switching (DGS) on GPUs using the CUDA programming language. DGS sacrifices absolute optimality in favor of low computation time and was designed as an alternative to classical LSAP solvers such as the Hungarian and auctioning methods. The contribution of the paper is threefold: First, we present the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Optimization and Search Problems · Game Theory and Voting Systems
