Abstract
Network-on-Chip (NoC) is becoming a promising communication architecture in place of dedicated interconnections and shared buses for embedded systems. Nevertheless, it has also created new design issue such as communication congestion and power consumption. A major factor leading to communication congestion is mapping of application tasks to NoC. Latency, throughput, and overall execution time are all affected by task mapping. As a solution, an efficient run-time Congestion-Aware Scheduling (CWS) is proposed for NoC-based reconfigurable systems, which predicts traffic pattern based on the link utilization. The proposed algorithm alleviates the overall congestion, instead of only improving the current packet blocking situation. Our experiment results have demonstrated that compared to other existing congestion-aware algorithm, the proposed CWS algorithm can reduce the average communication latency by 66%, increase the average throughput by 32%, reduce the energy consumption by 23%, and decrease the overall execution by 32%.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - Design, Automation and Test in Europe Conference and Exhibition, DATE 2012 |
| Pages | 1561-1566 |
| Number of pages | 6 |
| Publication status | Published - 2012 May 24 |
| Event | 15th Design, Automation and Test in Europe Conference and Exhibition, DATE 2012 - Dresden, Germany Duration: 2012 Mar 12 → 2012 Mar 16 |
Publication series
| Name | Proceedings -Design, Automation and Test in Europe, DATE |
|---|---|
| ISSN (Print) | 1530-1591 |
Other
| Other | 15th Design, Automation and Test in Europe Conference and Exhibition, DATE 2012 |
|---|---|
| Country | Germany |
| City | Dresden |
| Period | 12-03-12 → 12-03-16 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Engineering(all)
Cite this
}
Congestion-aware scheduling for NoC-based reconfigurable systems. / Chao, Hung Lin; Chen, Yean-Ru; Tung, Sheng Ya; Hsiung, Pao Ann; Chen, Sao Jie.
Proceedings - Design, Automation and Test in Europe Conference and Exhibition, DATE 2012. 2012. p. 1561-1566 6176721 (Proceedings -Design, Automation and Test in Europe, DATE).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Congestion-aware scheduling for NoC-based reconfigurable systems
AU - Chao, Hung Lin
AU - Chen, Yean-Ru
AU - Tung, Sheng Ya
AU - Hsiung, Pao Ann
AU - Chen, Sao Jie
PY - 2012/5/24
Y1 - 2012/5/24
N2 - Network-on-Chip (NoC) is becoming a promising communication architecture in place of dedicated interconnections and shared buses for embedded systems. Nevertheless, it has also created new design issue such as communication congestion and power consumption. A major factor leading to communication congestion is mapping of application tasks to NoC. Latency, throughput, and overall execution time are all affected by task mapping. As a solution, an efficient run-time Congestion-Aware Scheduling (CWS) is proposed for NoC-based reconfigurable systems, which predicts traffic pattern based on the link utilization. The proposed algorithm alleviates the overall congestion, instead of only improving the current packet blocking situation. Our experiment results have demonstrated that compared to other existing congestion-aware algorithm, the proposed CWS algorithm can reduce the average communication latency by 66%, increase the average throughput by 32%, reduce the energy consumption by 23%, and decrease the overall execution by 32%.
AB - Network-on-Chip (NoC) is becoming a promising communication architecture in place of dedicated interconnections and shared buses for embedded systems. Nevertheless, it has also created new design issue such as communication congestion and power consumption. A major factor leading to communication congestion is mapping of application tasks to NoC. Latency, throughput, and overall execution time are all affected by task mapping. As a solution, an efficient run-time Congestion-Aware Scheduling (CWS) is proposed for NoC-based reconfigurable systems, which predicts traffic pattern based on the link utilization. The proposed algorithm alleviates the overall congestion, instead of only improving the current packet blocking situation. Our experiment results have demonstrated that compared to other existing congestion-aware algorithm, the proposed CWS algorithm can reduce the average communication latency by 66%, increase the average throughput by 32%, reduce the energy consumption by 23%, and decrease the overall execution by 32%.
UR - http://www.scopus.com/inward/record.url?scp=84862085569&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862085569&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9783981080186
T3 - Proceedings -Design, Automation and Test in Europe, DATE
SP - 1561
EP - 1566
BT - Proceedings - Design, Automation and Test in Europe Conference and Exhibition, DATE 2012
ER -