Abstract
A parallel algorithm for prefix computation of N=2n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> elements on a Biswapped network (BSN) whose basis network is n×n mesh network is presented. BSN is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basis network and its basic network may be Hypercube, Mesh and other networks, BSN-Mesh is Biswapped network whose basis network is Mesh network. In this paper, the parallel prefix algorithm proposed takes time on N processors N communication steps.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
