원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
This paper introduces a new efficient algorithm for mapping linear array into hex-cell network. The capability of mapping several topologies is considered as one of the most important features of the hex-cell interconnection network. This feature is strongly affecting the performance of parallel machines. In this paper, we present a new algorithm for mapping linear array topology into hex-cell network with dilation and congestion of one;which indicates that we have one-to-one mapping as a result of intercommunication among nodes.
목차
Abstract
1. Introduction
2. Definition of Hex-Cell Network
3. Proposed Mapping Algorithm
3.1. The New Addressing Scheme for Hex-Hell Network
3.2. The Proposed Mapping Algorithm
3.3. Discussions via Example
4. Conclusion
Acknowledgment
References
1. Introduction
2. Definition of Hex-Cell Network
3. Proposed Mapping Algorithm
3.1. The New Addressing Scheme for Hex-Hell Network
3.2. The Proposed Mapping Algorithm
3.3. Discussions via Example
4. Conclusion
Acknowledgment
References
저자정보
참고문헌
자료제공 : 네이버학술정보