File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2019.8761499
- Scopus: eid_2-s2.0-85070208021
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: ILP Formulation for Designing Rings in Routerless Network-on-Chip
| Title | ILP Formulation for Designing Rings in Routerless Network-on-Chip |
|---|---|
| Authors | |
| Issue Date | 20-May-2019 |
| Abstract | In routerless network-on-chip (NoC), any pair of cores are directly connected via at least one isolated ring, such that high-cost routers can be entirely abandoned. In this paper, we focus on the problem of designing a set of rings that guarantee the connectivity and minimize the average hop count for all core pairs. We propose the first optimal integer linear programing (ILP) to design rings for any n×m chips under any given wiring constraint, i.e., the maximum number of wires allowed between any adjacent cores. Numerical results show that our ILP performs much better and is more flexible than the existing algorithms. But our ILP is time-consuming to solve and future work should focus on reducing its complexity. |
| Persistent Identifier | http://hdl.handle.net/10722/340720 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Xiao, Jie | - |
| dc.contributor.author | Yeung, Lawrence Kwan | - |
| dc.contributor.author | Jamin, Sugih | - |
| dc.date.accessioned | 2024-03-11T10:46:38Z | - |
| dc.date.available | 2024-03-11T10:46:38Z | - |
| dc.date.issued | 2019-05-20 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/340720 | - |
| dc.description.abstract | <p>In routerless network-on-chip (NoC), any pair of cores are directly connected via at least one isolated ring, such that high-cost routers can be entirely abandoned. In this paper, we focus on the problem of designing a set of rings that guarantee the connectivity and minimize the average hop count for all core pairs. We propose the first optimal integer linear programing (ILP) to design rings for any n×m chips under any given wiring constraint, i.e., the maximum number of wires allowed between any adjacent cores. Numerical results show that our ILP performs much better and is more flexible than the existing algorithms. But our ILP is time-consuming to solve and future work should focus on reducing its complexity.</p> | - |
| dc.language | eng | - |
| dc.relation.ispartof | IEEE International Conference on Communications (ICC) (20/05/2019-24/05/2019, , , Shanghai) | - |
| dc.title | ILP Formulation for Designing Rings in Routerless Network-on-Chip | - |
| dc.type | Conference_Paper | - |
| dc.identifier.doi | 10.1109/ICC.2019.8761499 | - |
| dc.identifier.scopus | eid_2-s2.0-85070208021 | - |
| dc.identifier.volume | 2019-May | - |