STM Journals Peer-reviewed research from Consortium e-Learning Network

Recent Trends in Parallel Computing

Fast All Sum Algorithm Over 2D-Mesh Network

  1. Gaytri Kumari Gupta
  2. Sudhanshu Kumar Jha

Abstract

Total sum (aka summation, all sums) is an important mathematical tool which is used extensively in various computational and statistical techniques. Fastest summation plays a vital role in overall calculation of specific technique which reduces cost and time. Thus in this paper we propose an improved parallel summation algorithm on 2D-Mesh network with N (=n2) processing elements which will perform summation of N (= n2) summands (or addends) in + 2 (or n + 2) times. Our proposed algorithm can be compared with traditional parallel approach which runs in 2n times for N summands on the same network.Keywords: All sums, 2D-mesh network, parallel algorithms, time complexityCite this ArticleGaytri Kumari Gupta, Sudhanshu Kumar Jha. Fast All Sum Algorithm over 2DMesh Network. Recent Trends in Parallel Computing. 2018; 5(3): 37–43p.
Support