Arbitrary-size permutation networks using arbitrary-radix switches

DOI10.1016/J.TCS.2023.113939MaRDI QIDQ6159027zbMATH OpenOpenAlexFDO

Authors Meng Zhang, Yi Zhang

Publication date 1 June 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2023.113939

zbMATH Keywords

Benes networkClos networkinterconnection network

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 3930907
• A new self-routing permutation network
• New self-routing permutation networks
• A fast VLSI-efficient self-routing permutation network
• scientific article; zbMATH DE number 1334211

Cites work

• A Permutation Network
• A simple algorithm for edge-coloring bipartite multigraphs
• Bipartite Edge Coloring in O(\Delta m) Time
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Efficient and scalable universal circuits
• scientific article; zbMATH DE number 3225079 (Why is no real title available?)
• On Edge Coloring Bipartite Graphs
• Symmetric Ternary Switching Functions: Their Detection and Realization with Threshold Logic
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds

Cited in

(1)

• Stride permutation networks for array processors

This page was built for publication: Arbitrary-size permutation networks using arbitrary-radix switches

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