按年被提到
20102010 · 1 次2026
算法与数据结构›经典算法与数据结构·arXiv:1002.4482 · cs.DC

Exploring the Limits of GPUs With Parallel Graph Algorithms

Frank Dehne, Kumanan Yogaratnam · 2010
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2010-02-25 · 最近 2013-12-06
2不同的人
2活跃月份
2讨论串
4被引(OpenAlex)
arXiv 摘要(候选层不写导读)

In this paper, we explore the limits of graphics processors (GPUs) for general purpose parallel computing by studying problems that require highly irregular data access patterns: parallel graph algorithms for list ranking and connected components. Such graph problems represent a worst case scenario for coalescing parallel memory accesses on GPUs which is critical for good GPU performance. Our experimental study indicates that PRAM algorithms are a good starting point for developing efficient parallel GPU methods but require non-trivial modifications to ensure good GPU performance. We present a set of guidelines that help algorithm designers adapt PRAM graph algorithms for parallel GPU computation. We point out that the study of parallel graph algorithms for GPUs is of wider interest for discrete and combinatorial problems in general because many of these problems require similar irregular data access patterns.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论chas · 2013-12

“GPUs have been used effectively in implementing graph algorithms. Graph algorithms are tremendously useful and show up all over computing. http://arxiv.org/abs/1002.4482 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.220.1923&rep=rep1&type=pdf”

Ask HN: Where else can we use GPU processing?原评论 ↗
被提交为 story · 1 次