返回
Lock-free parallel dynamic programming
DOI:10.1016/j.jpdc.2010.01.004.png)
摘要
En 中文
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the order in which the dynamic program computes its subproblems. This generic approach is applied to dynamic programs for knapsack, shortest paths, and RNA structure alignment, as well as to a state-of-the-art solution for minimizing the maximum number of open stacks. Experimental results are provided on three different modern multicore architectures which show that this parallelization is effective and reasonably scalable. In particular, we obtain over 10 times speedup for 32 threads on the open stacks problem. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Dynamic programming
Lock-free hash tables
Constraint programming
Multicores
Parallelism
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Synovial fluid interleukin 6, tumor necrosis factor, and nitric oxide values in dogs with osteoarthritis secondary to cranial cruciate ligament rupture继发于颅骨交叉韧带断裂的骨关节炎犬的滑液白介素6,肿瘤坏死因子和一氧化氮值
Characterization of polymer matrix and low melting point solder for anisotropic conductive film各向异性导电膜用聚合物基体及低熔点焊料的表征
A benchmark of multiple sequence alignment programs upon structural RNAs
NUCLEIC ACIDS RESEARCH
IF13.1

