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

Date
2015
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
2015 49th Annual Conference on Information Sciences and Systems (CISS)
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
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 & LeftFloor;n over 2⌋ columns, and achieves Kn graph without connecting any wires between any three adjacent blocks, thus preserving locality in connections. © 2015 IEEE.

Course
Other identifiers
Book Title
Keywords
Citation
Published Version (Please cite this version)