A locality preserving one-sided binary tree-Crossbar switch wiring design algorithm
2015 49th Annual Conference on Information Sciences and Systems, CISS 2015
Institute of Electrical and Electronics Engineers Inc.
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28385
One-sided crossbar switches allow for a simple implementation of complete K<inf>n</inf> graphs. However, designing these circuits is a cumbersome process and can be automated. We present an algorithm that allows designing automatic one-sided binary tree-crossbar switches which do not exceed & LeftFloor;n over 2⌋ columns, and achieves K<inf>n</inf> graph without connecting any wires between any three adjacent blocks, thus preserving locality in connections. © 2015 IEEE.
- Conference Paper 2294