Title :
A locality preserving one-sided binary tree - Crossbar switch wiring design algorithm
Author_Institution :
Dept. of Comput. Sci. & Eng., Bilkent Univ., Ankara, Turkey
Abstract :
One-sided crossbar switches allow for a simple implementation of complete Kn 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 ⌊n/2⌋ columns, and achieves Kn graph without connecting any wires between any three adjacent blocks, thus preserving locality in connections.
Keywords :
circuit CAD; graphs; switches; trees (mathematics); wiring; adjacent blocks; circuit design; complete graphs; cumbersome process; one-sided binary tree-crossbar switch wiring design algorithm; preserving locality connections; Algorithm design and analysis; Binary trees; Computer science; Joining processes; Switches; Wires; Wiring;
Conference_Titel :
Information Sciences and Systems (CISS), 2015 49th Annual Conference on
Conference_Location :
Baltimore, MD
DOI :
10.1109/CISS.2015.7086839
