检索结果-内蒙古大学图书馆

HyLAC: Hybrid linear assignment solver in CUDA

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2024年 187卷

作者： Kawtikwar, Samiran Nagi, Rakesh Univ Illinois Ind & Enterprise Syst Engn Champaign IL 61820 USA Singapore Univ Technol & Design Engn Syst & Design Singapore Singapore

The Linear Assignment Problem (LAP) is a fundamental combinatorial optimization problem with a wide range of applications. Over the years, significant progress has been made in developing efficient algorithms to solve the LAP, particularly in the realm of high-performance computing, leading to remarkable reductions in computation time. In recent years, hardware improvements in General Purpose graphics Processing Units (GPgpus) have shown promise in meeting the ever-increasing compute bandwidth requirements. This has attracted researchers to develop gpu-accelerated algorithms to solve the LAP. Recent work in the gpu domain has uncovered parallelism available in the problem structure to achieve significant performance improvements. However, each solution presented so far targets either sparse or dense instances of the problem and has some scope for improvement. The Hungarian algorithm is one of the most famous approaches to solving the LAP in polynomial time. Hungarian algorithm has classical O(N-4) (Munkres') and tree based O(N-3) (Lawler's) implementations. It is well established that the Munkres' implementation is faster for sparse LAP instances while the Lawler's implementation is faster for dense instances. In this work, we blend the gpu implementations of Munkres' and Lawler's to develop a Hybrid gpu-accelerated solver for LAP that switches between the two implementations based on available sparsity. Also, we improve the existing gpu implementations to reduce memory contention, minimize CPU-gpu synchronizations, and coalesced memory access. The resulting solver (HyLAC) works faster than existing CPU/gpu LAP solvers for sparse as well as dense problem instances. HyLAC achieves a speedup of up to 6.14x over existing state-of-the-art gpu implementation when run on the same hardware. We also develop an implementation to solve a list of small LAPs (tiled LAP), which is particularly useful in the optimization domain. This tiled LAP solver performs 22.59x faster than t

关键词： Hungarian algorithm Linear assignment problem gpu-accelerated graph algorithms High-performance computing Parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：