• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

A FineGrained Parallel Algorithm for the Cholesky Decomposition

Expand
  • (School of Computer Science,National University of Defense Technology,Changsha 410073,China)

Received date: 2010-03-11

  Revised date: 2010-06-19

  Online published: 2010-09-02

Abstract

This paper presents a finegrained pipeline parallel algorithm for the Cholesky decomposition, which is applicable to the matrices of arbitrary orders and can exploit finegrained parallelism of the FPGA accelerators. The experimental results show this algorithm has good scalability. 36 processing elements (PEs) can be integrated into a Xilinx XC5VLX330 FPGA, achieving a performance of 14.3 Gflops when the matrix order is 16 384 at the clock speed of 200 MHz.

Cite this article

WU Guiming,DOU Yong,WANG Miao . A FineGrained Parallel Algorithm for the Cholesky Decomposition[J]. Computer Engineering & Science, 2010 , 32(9) : 102 -106 . DOI: 10.3969/j.issn.1007130X.2010.

Outlines

/