一种用于LLP组合问题的通用并行框架
A common parallel framework for LLP combinatorial problems
AI总结:
本文提出LLP-FW通用锁自由运行时,可解决多种组合优化问题,通过并行处理禁止局部状态以获得解,展示了其在多个问题上的有效性。
摘要:
传统锁自由并行算法用于组合优化问题,如最短路径、稳定匹配和作业调度,需要程序员编写特定于问题的代码和同步代码。我们提出了一种通用锁自由运行时LLP-FW,能够解决所有可以形式化为晶格-线性谓词的组合优化问题,通过并行推进所有禁止的局部状态直到得到解。唯一的特定于问题的代码是禁止性检查的定义和推进的定义。我们展示了LLP-FW能够解决多种不同的组合优化问题,如单源最短路径(SSSP)、广度优先搜索(BFS)、稳定婚姻、作业调度、传递闭包、并行减少和0-1背包。我们比较了LLP-FW与手调的定制解决方案,并显示其在大多数情况下表现良好。
英文摘要:
Traditional lock-free parallel algorithms for combinatorial optimization problems, such as shortest paths, stable matching, and job scheduling require programmers to write problem-specific routines and synchronization code. We propose a general-purpose lock-free runtime, LLP-FW that can solve all combinatorial optimization problems that can be formulated as a Lattice-Linear Predicate by advancing all forbidden local states in parallel until a solution emerges. The only problem-specific code is a definition of the forbiddenness check and a definition of the advancement. We show that LLP-FW can solve several different combinatorial optimization problems, such as Single Source Shortest Paths (SSSP), Breadth-First Search (BFS), Stable Marriage, Job Scheduling, Transitive Closure, Parallel Reduction, and 0-1 Knapsack. We compare LLP-FW against hand-tuned, custom solutions for these seven problems and show that it compares favorably in the majority of cases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。