Show simple item record

dc.contributor.authorŞahin, Devrimen_US
dc.coverage.spatialBaltimore, MD, USAen_US
dc.date.accessioned2016-02-08T12:19:15Z
dc.date.available2016-02-08T12:19:15Z
dc.date.issued2015en_US
dc.identifier.urihttp://hdl.handle.net/11693/28385
dc.descriptionDate of Conference: 18-20 March 2015en_US
dc.description.abstractOne-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.en_US
dc.language.isoEnglishen_US
dc.source.title2015 49th Annual Conference on Information Sciences and Systems (CISS)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/CISS.2015.7086839en_US
dc.titleA locality preserving one-sided binary tree-Crossbar switch wiring design algorithmen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Technology and Information Systemsen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.identifier.doi10.1109/CISS.2015.7086839en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record