A locality preserving one-sided binary tree-Crossbar switch wiring design algorithm

Thumbnail
Author
Şahin, Devrim
Date
2015
Source Title
2015 49th Annual Conference on Information Sciences and Systems (CISS)
Publisher
IEEE
Language
English
Type
Conference Paper
Item Usage Stats
130
views
98
downloads
Metadata
Show full item record
Abstract
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.
Permalink
http://hdl.handle.net/11693/28385
Published Version (Please cite this version)
http://dx.doi.org/10.1109/CISS.2015.7086839
Collections