A new parallel approach for prefix sum on BSN mesh

Abstract

Bi Swapped Networks (BSN) is a symmetrical hybrid Opto-electronic network architecture related to the family of Swapped/OTIS interconnection networks. In fact, the symmetrical nature the network supports ease of design and implementation of parallel algorithms in comparison to its well known counterpart asymmetrical Opto-electronic network named OTIS networks. BSN mesh contains 2n4 copies (n represents each groups' row or column processors) of groups (basis networks), where each group is connected in complete bipartite pattern to their corresponding groups in the opposite part. In this paper, the parallel algorithm for prefix computation is proposed over it. The proposed parallel approach performs prefix over n × n BSN mesh in 13(n-1) and 3 optical moves. The algorithm claims to present a new and efficient approach to map parallel prefix than the existing modified prefix computation [14] over BSN mesh.