A locality preserving one-sided binary tree-Crossbar switch wiring design algorithm
| dc.contributor.author | Şahin, Devrim | en_US |
| dc.coverage.spatial | Baltimore, MD, USA | en_US |
| dc.date.accessioned | 2016-02-08T12:19:15Z | |
| dc.date.available | 2016-02-08T12:19:15Z | |
| dc.date.issued | 2015 | en_US |
| dc.department | Department of Computer Technology and Information Systems | en_US |
| dc.department | Department of Computer Engineering | en_US |
| dc.description | Date of Conference: 18-20 March 2015 | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.1109/CISS.2015.7086839 | en_US |
| dc.identifier.uri | http://hdl.handle.net/11693/28385 | |
| dc.language.iso | English | en_US |
| dc.publisher | IEEE | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/CISS.2015.7086839 | en_US |
| dc.source.title | 2015 49th Annual Conference on Information Sciences and Systems (CISS) | en_US |
| dc.title | A locality preserving one-sided binary tree-Crossbar switch wiring design algorithm | en_US |
| dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- A locality preserving one-sided binary tree - Crossbar switch wiring design algorithm.pdf
- Size:
- 529.33 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full Printable Version