z-logo
open-access-imgOpen Access
Parallel Prefix Sum Algorithm on Optoelectronic Biswapped Network Hyper Hexa-cell
Author(s) -
Ashish Gupta,
Bikash Kanti Sarkar
Publication year - 2018
Publication title -
international journal of computer network and information security
Language(s) - English
Resource type - Journals
eISSN - 2074-9104
pISSN - 2074-9090
DOI - 10.5815/ijcnis.2018.08.03
Subject(s) - computer science , hexa , node (physics) , algorithm , parallel computing , prefix , routing (electronic design automation) , computer network , physics , linguistics , chemistry , philosophy , quantum mechanics , medicinal chemistry
The biswapped network hyper hexa-cell is recently reported optoelectronic network architecture for delivering excellent performance especially for mapping numerical problems which demands frequent routing and broadcasting. This network contains some important benefits such as smaller diameter, higher bisection width, and lower network’s total and optical cost as compared to counter-part OTIS hyper hexa-cell network. It is also advantageous as compared to the traditional biswapped network mesh containing smaller diameter and higher minimum node degree. In this paper, we present a parallel algorithm for mapping prefix sum of 2 × (6 × 2h) 2 data elements on a dh-dimensional biswapped network hyper hexa-cell of 2 × (6 × 2h) 2 processors (assuming each processor contain single data element). It demands total ((dh − 1) × (dh + 1)) − (dh− 1)×(dh− 2) 2 + 5dh + 9 intra-cluster (electronic) and 3 inter-cluster (optical) moves.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom