A parallel algorithm for accurate dot product

N. Yamanaka*, T. Ogita, S. M. Rump, S. Oishi


研究成果: Article査読

12 被引用数 (Scopus)


Parallel algorithms for accurate summation and dot product are proposed. They are parallelized versions of fast and accurate algorithms of calculating sum and dot product using error-free transformations which are recently proposed by Ogita et al. [T. Ogita, S.M. Rump, S. Oishi, Accurate sum and dot product, SIAM J. Sci. Comput. 26 (6) (2005) 1955-1988]. They have shown their algorithms are fast in terms of measured computing time. However, due to the strong data dependence in the process of their algorithms, it is difficult to parallelize them. Similarly to their algorithms, the proposed parallel algorithms in this paper are designed to achieve the results as if computed in K-fold working precision with keeping the fastness of their algorithms. Numerical results are presented showing the performance of the proposed parallel algorithm of calculating dot product.

ジャーナルParallel Computing
出版ステータスPublished - 2008 7月

ASJC Scopus subject areas

  • ソフトウェア
  • 理論的コンピュータサイエンス
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 人工知能


「A parallel algorithm for accurate dot product」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。