On Task Clustering for Network-on-Chip Designs
碩士 === 國立交通大學 === 電子工程系所 === 93 === The Network-on-Chip (NoC) has become a new trend in on-chip system communication design. We have developed a complete design flow for NoC system design. In this thesis we focus on the task clustering in our NoC design flow. The task clustering problem in the NoC s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73503902464514426112 |
| id |
ndltd-TW-093NCTU5427032 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-093NCTU54270322015-10-13T12:56:37Z http://ndltd.ncl.edu.tw/handle/73503902464514426112 On Task Clustering for Network-on-Chip Designs 針對在單晶片網路系統中任務群組之研究 Yung-Chun Lei 雷永群 碩士 國立交通大學 電子工程系所 93 The Network-on-Chip (NoC) has become a new trend in on-chip system communication design. We have developed a complete design flow for NoC system design. In this thesis we focus on the task clustering in our NoC design flow. The task clustering problem in the NoC system design needs to consider multiple constraints, which include computing power, memory, I/O and communication bandwidth. We introduce an algorithm to minimize the number of clusters in the result with all constraints being met. The algorithm has been written as an automatic program and some experimental results are presented. Using our program, we can reduce the number of clusters with all constraints satisfied in few minutes. Jing-Yang Jou 周景揚 2005 學位論文 ; thesis 41 en_US |
| collection |
NDLTD |
| language |
en_US |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國立交通大學 === 電子工程系所 === 93 === The Network-on-Chip (NoC) has become a new trend in on-chip system communication design. We have developed a complete design flow for NoC system design. In this thesis we focus on the task clustering in our NoC design flow. The task clustering problem in the NoC system design needs to consider multiple constraints, which include computing power, memory, I/O and communication bandwidth. We introduce an algorithm to minimize the number of clusters in the result with all constraints being met. The algorithm has been written as an automatic program and some experimental results are presented. Using our program, we can reduce the number of clusters with all constraints satisfied in few minutes.
|
| author2 |
Jing-Yang Jou |
| author_facet |
Jing-Yang Jou Yung-Chun Lei 雷永群 |
| author |
Yung-Chun Lei 雷永群 |
| spellingShingle |
Yung-Chun Lei 雷永群 On Task Clustering for Network-on-Chip Designs |
| author_sort |
Yung-Chun Lei |
| title |
On Task Clustering for Network-on-Chip Designs |
| title_short |
On Task Clustering for Network-on-Chip Designs |
| title_full |
On Task Clustering for Network-on-Chip Designs |
| title_fullStr |
On Task Clustering for Network-on-Chip Designs |
| title_full_unstemmed |
On Task Clustering for Network-on-Chip Designs |
| title_sort |
on task clustering for network-on-chip designs |
| publishDate |
2005 |
| url |
http://ndltd.ncl.edu.tw/handle/73503902464514426112 |
| work_keys_str_mv |
AT yungchunlei ontaskclusteringfornetworkonchipdesigns AT léiyǒngqún ontaskclusteringfornetworkonchipdesigns AT yungchunlei zhēnduìzàidānjīngpiànwǎnglùxìtǒngzhōngrènwùqúnzǔzhīyánjiū AT léiyǒngqún zhēnduìzàidānjīngpiànwǎnglùxìtǒngzhōngrènwùqúnzǔzhīyánjiū |
| _version_ |
1716869664026394624 |