CLC number: TP202; TN402
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 2014-10-22
Cited: 2
Clicked: 7406
Qian-qi Le, Guo-wu Yang, William N. N. Hung, Xiao-yu Song, Fu-you Fan. Performance-driven assignment and mapping for reliable networks-on-chips[J]. Journal of Zhejiang University Science C, 2014, 15(11): 1009-1020.
@article{title="Performance-driven assignment and mapping for reliable networks-on-chips",
author="Qian-qi Le, Guo-wu Yang, William N. N. Hung, Xiao-yu Song, Fu-you Fan",
journal="Journal of Zhejiang University Science C",
volume="15",
number="11",
pages="1009-1020",
year="2014",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.C1400055"
}
%0 Journal Article
%T Performance-driven assignment and mapping for reliable networks-on-chips
%A Qian-qi Le
%A Guo-wu Yang
%A William N. N. Hung
%A Xiao-yu Song
%A Fu-you Fan
%J Journal of Zhejiang University SCIENCE C
%V 15
%N 11
%P 1009-1020
%@ 1869-1951
%D 2014
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.C1400055
TY - JOUR
T1 - Performance-driven assignment and mapping for reliable networks-on-chips
A1 - Qian-qi Le
A1 - Guo-wu Yang
A1 - William N. N. Hung
A1 - Xiao-yu Song
A1 - Fu-you Fan
J0 - Journal of Zhejiang University Science C
VL - 15
IS - 11
SP - 1009
EP - 1020
%@ 1869-1951
Y1 - 2014
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.C1400055
Abstract: network-on-chip (NoC) communication architectures present promising solutions for scalable communication requests in large system-on-chip (SoC) designs. Intellectual property (IP) core assignment and mapping are two key steps in NoC design, significantly affecting the quality of NoC systems. Both are NP-hard problems, so it is necessary to apply intelligent algorithms. In this paper, we propose improved intelligent algorithms for NoC assignment and mapping to overcome the drawbacks of traditional intelligent algorithms. The aim of our proposed algorithms is to minimize power consumption, time, area, and load balance. This work involves multiple conflicting objectives, so we combine multiple objective optimization with intelligent algorithms. In addition, we design a fault-tolerant routing algorithm and take account of reliability using comprehensive performance indices. The proposed algorithms were implemented on embedded system synthesis benchmarks suite (E3S). Experimental results show the improved algorithms achieve good performance in NoC designs, with high reliability.
[1]Bjerregaard, T., Mahadevan, S., 2006. A survey of research and practices of network-on-chip. ACM Comput. Surv., 38(1):1.1-1.51.
[2]Cheng, A.L., Pan, Y., Yan, X.L., et al., 2011. A general communication performance evaluation model based on routing path decomposition. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 12(7):561-573.
[3]da Silva, M.V.C., Nedjah, N., Mourelle, L.M., 2010. Power-aware multi-objective evolutionary optimisation for application mapping on network-on-chip platforms. Int. J. Electron., 97(10):1163-1179.
[4]Das, R., Eachempati, S., Mishra, A.K., et al., 2009. Design and evaluation of a hierarchical on-chip interconnect for next-generation CMPs. Proc. IEEE 15th Int. Symp. on High Performance Computer Architecture, p.175-186.
[5]Hu, J., Marculescu, R., 2003. Energy-aware mapping for tile-based NoC architectures under performance constraints. Proc. Asia and South Pacific Design Automation Conf., p.233-239.
[6]Hung, W.N.N., Song, X., 2001. BDD variable ordering by scatter search. Proc. Int. Conf. on Computer Design, p.368-373.
[7]Jena, R.K., Sharma, G.K., 2007. A multi-objective evolutionary algorithm based optimization model for network-on-chip synthesis. Proc. 4th Int. Conf. on Information Technology, p.977-982.
[8]Liu, W., Gu, Z., Xu, J., et al., 2011. Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems. IEEE Trans. Parall. Distr. Syst., 22(8):1382-1389.
[9]Marculescu, R., Ogras, U.Y., Peh, L.S., et al., 2009. Outstanding research problems in NoC design: system, microarchitecture, and circuit perspectives. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst., 28(1):3-21.
[10]Masehian, E., Sedighizadeh, D., 2010. Multi-objective robot motion planning using a particle swarm optimization model. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 11(8):607-619.
[11]Muralimanohar, N., Balasubramonian, R., Jouppi, N., 2007. Optimizing NUCA organizations and wiring alternatives for large caches with CACTI 6.0. Proc. 40th Annual IEEE/ACM Int. Symp. on Microarchitecture, p.3-14.
[12]Orgas, U.Y., Hu, J., Marculescu, R., 2005. Key research problems in NoC design: a holistic perspective. Proc. 3rd IEEE/ACM/IFIP Int. Conf. on Hardware/Software Codesign and System Synthesis, p.69-74.
[13]Rao, A.R.M., Arvind, N., 2005. A scatter search algorithm for stacking sequence optimisation of laminate composites. Compos. Struct., 70(4):383-402.
[14]Refan, F., Alemzadeh, H., Safari, S., et al., 2008. Reliability in application specific mesh-based NoC architectures. Proc. 14th IEEE Int. On-line Testing Symp., p.207-212.
[15]Saxena, P.C., Gupta, S., Rai, J., 2003. A delay optimal coterie on the k-dimensional folded Petersen graph. J. Parall. Distr. Comput., 63(11):1026-1035.
[16]Sepulveda, M.J., Strum, M., Chau, W.J., 2011. A multi-objective adaptive immune algorithm for NoC mapping. Proc. 17th IFIP Int. Conf. on Very Large Scale Integration, p.193-196.
[17]Tang, L., Kumar, S., 2003. A two-step genetic algorithm for mapping task graphs to a network on chip architecture. Euromicro Symp. on Digital System Design, p.180-187.
[18]Wang, J., Jiao, Y., Song, X., et al., 2012a. Optimal training sequences for indoor wireless optical communications. J. Opt., 14(1):015401.1-015401.5.
[19]Wang, J., Xie, X., Jiao, Y., et al., 2012b. Optimal odd-periodic complementary sequences for diffuse wireless optical communications. Opt. Eng., 51(9):095002.1-095002.6.
[20]Yu, Q., Ampadu, P., 2010. A flexible parallel simulator for networks-on-chip with error control. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst., 29(1):103-116.
Open peer comments: Debate/Discuss/Question/Opinion
<1>