Permutation algorithms on optical multi-trees

DOI10.1016/J.CAMWA.2008.03.060MaRDI QIDQ2389510zbMATH OpenOpenAlexFDO

Authors Prasanta K. Jana, Koushik Sinha

Publication date 17 July 2009

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2008.03.060

zbMATH Keywords

shuffletransposebit reversalpermutation routingoptical multi-treesoptoelectronic computervector reversal

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Euro-Par 2004 Parallel Processing
• scientific article; zbMATH DE number 1236493
• An optimal algorithm for permutation admissibility to multistage interconnection networks
• Permutation capability of optical multistage interconnection networks
• Permuting data with the Omega network

Cites work

• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• scientific article; zbMATH DE number 1236493 (Why is no real title available?)
• scientific article; zbMATH DE number 1241032 (Why is no real title available?)
• An optimal routing algorithm for mesh-connected Parallel computers
• Euro-Par 2004 Parallel Processing
• Optimal parallel algorithms for computing convex hulls and for sorting
• Parallel Processing with the Perfect Shuffle
• Scalable network architectures using the optical transpose interconnection system (OTIS)

Cited in

(3)

• An optimal algorithm for permutation admissibility to multistage interconnection networks
• Novel algorithm for complex bit reversal: Employing vector permutation and branch reduction methods
• Permutation capability of optical multistage interconnection networks

Describes a project that uses

Uses Software

• OMULT

This page was built for publication: Permutation algorithms on optical multi-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389510)