Permutation algorithms on optical multi-trees

Citations of this article
Mendeley users who have this article in their library.
Get full text


The Optical Multi-Trees (OMULT) is an interconnection network proposed by Sinha and Bandyopadhyay [B.P. Sinha, S. Bandyopadhyay, OMULT: An optical interconnection system for parallel computing, Lecture notes in Computer Science 3149 (2004) 302-312], for optoelectronic parallel computers. Various algorithms including matrix multiplication, DFT computation, sorting, prefix sum have been successfully mapped on this architecture. In this paper, we develop efficient parallel algorithms for some commonly used permutations namely, bit reversal, vector reversal, perfect shuffle, unshuffle and transpose on the OMULT network. Our algorithm for bit reversal permutation requires 8 log n electronic moves +7 optical moves for n2data elements and O (n) electronic moves +3 optical moves for n3data elements; the vector reversal for n3data elements requires 3 g (n) electronic moves +4 optical moves, where g (n) is the time for local vector reversal on n data elements; the perfect shuffle for n3data elements requires (3 f (n) + 8) electronic moves +8 optical moves, where f (n) is the time for local perfect shuffle on n data elements, and the transpose for n3data elements runs in at most three optical moves, all using 2 n3-n2processors. © 2008 Elsevier Ltd. All rights reserved.




Jana, P. K., & Sinha, K. (2008). Permutation algorithms on optical multi-trees. Computers and Mathematics with Applications, 56(10), 2656–2665.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free