지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2013.11
- 수록면
- 31 - 34 (4page)
이용수
초록· 키워드
오류제보하기
On-chip communication appears to have an extremely significant role in taking advantage of the inherent parallelization offered by the MPSoCs. If interconnection networks are to be used efficiently in such platforms, designing high-performance routing algorithms is inevitable. In this paper, a deadlock-free and highly adaptive multicast/unicast routing method is presented based on the Hamiltonian routing model. This method strives for a high degree of adaptiveness by finding the maximum number of minimal paths between each pair of source and destination. Experimental results demonstrate that the proposed method significantly outperforms the other adaptive and non-adaptive algorithms in terms of latency and power consumption. This efficiency is achieved by alleviating the number of hotspots through a better traffic distribution all over the network.
목차
Abstract
Introduction
Background and Related Work
Proposed Routing Method
Simulation Results and Discussion
Conclusion and Future Work
References
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2016-569-001048352