Routing Algorithms for Cellular Interconnection Arrays
DOI10.1109/TC.1984.1676359zbMATH Open0546.68034OpenAlexW1882821821MaRDI QIDQ3336697FDOQ3336697
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
Recommendations
interconnection networksalgebraic modelrouting algorithmscellular arraycellular interconnection arraysmonotone increasing factorizationpermutation celltransposition maps
Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15)
Cited In (6)
- A new algorithm for standard cell global routing
- Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
- A finite automata approach to modeling the cross product of interconnection networks.
- Title not available (Why is that?)
- A three-layer over-the-cell multi-channel router for a new cell model
- Title not available (Why is that?)
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)