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

Thumbnail
View/Open
Author
Şahin, D.
Date
2015
Journal Title
2015 49th Annual Conference on Information Sciences and Systems, CISS 2015
Publisher
Institute of Electrical and Electronics Engineers Inc.
Language
English
Type
Conference Paper
Item Usage Stats
9
views
2
downloads
Metadata
Show full item record
Please cite this item using this persistent URL
http://hdl.handle.net/11693/28385
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.
Published as
http://dx.doi.org/10.1109/CISS.2015.7086839
Collections