A locality preserving one-sided binary tree - Crossbar switch wiring design algorithm
Devrim Sahin · 2015
One-sided crossbar switches allow for a simple implementation of complete Kngraphs. 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 Kngraph without connecting any wires between any three adjacent blocks, thus preserving locality in connections.