Routing Algorithms for Cellular Interconnection Arrays

DOI10.1109/TC.1984.1676359MaRDI QIDQ3336697zbMATH OpenOpenAlexFDO

Authors A. Yavuz Oruç, Deepak Prakash

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1984.1676359

zbMATH Keywords

algebraic modelcellular arraycellular interconnection arraysinterconnection networksmonotone increasing factorizationpermutation cellrouting algorithmstransposition maps

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15)

Recommendations

• A fast parallel algorithm for routing in permutation networks
• Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
• Fast permutation routing in a class of interconnection networks
• Permutation routing on reconfigurable meshes
• scientific article; zbMATH DE number 933177

Cited in

(6)

• A finite automata approach to modeling the cross product of interconnection networks.
• scientific article; zbMATH DE number 3943048 (Why is no real title available?)
• Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
• A new algorithm for standard cell global routing
• scientific article; zbMATH DE number 139974 (Why is no real title available?)
• A three-layer over-the-cell multi-channel router for a new cell model

This page was built for publication: Routing Algorithms for Cellular Interconnection Arrays

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