FPGA based parallel transitive closure algorithm.

SAC'11: The 2011 ACM Symposium on Applied Computing TaiChung Taiwan March, 2011(2011)

引用 0|浏览34
暂无评分
摘要
In this paper, we propose a FPGA-based parallel algorithm to compute the transitive closure of the relation matrix on a fixed-size PE array. Experimental results showed that speedup increases with the problem size. The speedup against a single PE is between 11.3 and 195.9. Compared to a general CPU solution, this algorithm achieves acceleration rate of 3.7 and 376 under the worst and best situations, respectively.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要