Network Partitioning & IP Placement in Network-on-Chip (NoC) :M/M/1/B Markov Chain Modelling

Among the hardest problem in Networks-on-Chip (NoC) design is to customize the topological structure of the on-chip network in order to fulfill application demand on minimal possible cost. The area cost of NoC is cut down by using Network Partitioning methods where it splits the large network into s...

全面介紹

Saved in:
書目詳細資料
主要作者: Asrani, Lit
格式: 圖書
語言:English
出版: LAP LAMBERT Academic Publishing 2012
主題:
在線閱讀:http://ir.unimas.my/id/eprint/41651/1/Network%20Partitioning%20%26%20IP%20Placement.pdf
http://ir.unimas.my/id/eprint/41651/
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
實物特徵
總結:Among the hardest problem in Networks-on-Chip (NoC) design is to customize the topological structure of the on-chip network in order to fulfill application demand on minimal possible cost. The area cost of NoC is cut down by using Network Partitioning methods where it splits the large network into smaller division. The enhancement in area cost is reached by trimming both router area and the number of global links. From the performance context, Multi-Level Network Partitioning offers a better solution by implemented the concept of clustering. This can be done by putting those heavily communicated cores into the same portion. Therefore, the average internode distances could be minimized. This directly imply a better performance due its to shortest path. For evaluation purpose, some performance metrics are employed which are throughputs, average queue size, probability of packet lost and waiting time. As validation, the proposed technique is experimented with various real System-on-Chip (SoC) applications as case studies.