Name
Abstract | ||
|---|---|---|
Networks-on-chip (NoC) has been recognized as a scalable approach to cope with the increasingly large demand for on-chip communication. This work focuses on how to achieve guaranteed service for application-specific NoCs through resource reservation. A graph model is adopted to describe physical and temporal sources of an NoC in a unified manner. Based on the graph model, two resource allocation heuristics are proposed and investigated. One heuristic leverages the idea of chip layout routing and the other utilizes Boolean satisfiability. Results from simulation from various testcases indicate that the proposed methods significantly outperform a state-of-the-art previous work. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ICCD.2013.6657088 | 2013 IEEE 31ST INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD) |
Keywords | Field | DocType |
network routing,computability,resource allocation,network on chip,graph theory | Graph theory,Reservation,Heuristic,Computer science,Boolean satisfiability problem,Network on a chip,Computer network,Real-time computing,Heuristics,Resource allocation,Scalability,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.36 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gongming Yang | 1 | 3 | 0.75 |
| Hao He | 2 | 3 | 1.76 |
| Jiang Hu | 3 | 668 | 65.67 |