Permutation algorithms on optical multi-trees

Prasanta K. Jana, Koushik Sinha

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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 n2 data elements and O (n) electronic moves +3 optical moves for n3 data elements; the vector reversal for n3 data 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 n3 data 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 n3 data elements runs in at most three optical moves, all using 2 n3-n2 processors.

Original languageEnglish
Pages (from-to)2656-2665
Number of pages10
JournalComputers and Mathematics with Applications
Volume56
Issue number10
DOIs
Publication statusPublished - 1 Nov 2008

    Fingerprint

Keywords

  • Bit reversal
  • Optical multi-trees
  • Optoelectronic computer
  • Permutation routing
  • Shuffle
  • Transpose
  • Vector reversal

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this