The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
이 어플리케이션에는 XNUMXµm 및 XNUMXµm 파장에서 최대 XNUMXW의 평균 출력을 제공하는 재귀적으로 분해 가능한 상호 연결 네트워크 (RDIN)은 토폴로지와 속성이 원래 구조와 유사한 더 작은 하위 구조로 재귀적으로 분해될 수 있는 상호 연결 네트워크 세트입니다. RDIN의 예로는 하이퍼큐브, 별 그래프, 메쉬, 트리, 피라미드, 팬케이크 및 WK-재귀 네트워크가 있습니다. 본 논문에서는 처음에 컴퓨터 내부의 RDIN을 표현하기 위해 통일되고 간단한 모델을 제안하였다. 이 모델을 기반으로 RDIN의 모든 구성원에게 적용할 수 있는 일반화되고 효율적인 할당 방식이 개발되었습니다. 제안된 방식은 하위 구조(하위 큐브, 하위 별, 하위 트리 등)를 이전보다 더 쉽게 완벽하게 인식할 수 있으며, 불완전한 하위 구조를 모두 완벽하게 인식할 수 있는 최초의 방식입니다. 최적의 할당도 제안됩니다. 이 기준은 최적 할당의 철학과 마찬가지로 가장 큰 자유 부품이 파괴되지 않도록 하는 것을 목표로 합니다. 더욱이, 제안된 방식은 프로세서 및/또는 링크에 결함이 있는 손상된 RDIN에서 수행될 수 있습니다. 마지막으로 RDIN의 두 인스턴스인 하이퍼큐브와 별 그래프에 대한 수학적 분석 및 시뮬레이션이 제시됩니다. 결과는 일반화된 체계가 특정 구조를 위해 설계된 다른 독점 할당 체계보다 성능이 뛰어나거나 비교할 수 있음을 보여줍니다.
배당, 상호 연결 네트워크, 첫 번째 적합, 하이퍼큐브, 별 그래프
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Fan WU, Ching-Chi HSU, "A Generalized Processor Allocation Scheme for Recursively Decomposable Interconnection Networks" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 4, pp. 694-713, April 2002, doi: .
Abstract: The Recursively Decomposable Interconnection Network (RDIN) is a set of interconnection networks that can be recursively decomposed into smaller substructures whose topologies and properties are similar to the original one. The examples of the RDIN are hypercubes, star graph, mesh, tree, pyramid, pancake, and WK-recursive network. This paper proposed a uniform and simple model to represent the RDIN inside computers at first. Based on the model, a generalized and efficient allocation scheme capable of being applied to all the members of the RDIN is developed. The proposed scheme can fully recognize the substructures (such as subcube, substar, subtree,. . . ) more easily than ever, and it is the first one that can fully recognize all the incomplete substructures. The best-fit allocation is also proposed. The criterion aims at keeping the largest free parts from being destroyed, as is the philosophy of the best-fit allocation. Moreover, the proposed scheme can be performed in an injured RDIN with its processors and/or links faulty. Finally, the mathematical analysis and simulations for two instances, hypercubes and star graphs, of the RDIN are presented. The results show that the generalized scheme outperforms or is comparable to the other proprietary allocation schemes designed for the specific structure.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_4_694/_p
부
@ARTICLE{e85-d_4_694,
author={Fan WU, Ching-Chi HSU, },
journal={IEICE TRANSACTIONS on Information},
title={A Generalized Processor Allocation Scheme for Recursively Decomposable Interconnection Networks},
year={2002},
volume={E85-D},
number={4},
pages={694-713},
abstract={The Recursively Decomposable Interconnection Network (RDIN) is a set of interconnection networks that can be recursively decomposed into smaller substructures whose topologies and properties are similar to the original one. The examples of the RDIN are hypercubes, star graph, mesh, tree, pyramid, pancake, and WK-recursive network. This paper proposed a uniform and simple model to represent the RDIN inside computers at first. Based on the model, a generalized and efficient allocation scheme capable of being applied to all the members of the RDIN is developed. The proposed scheme can fully recognize the substructures (such as subcube, substar, subtree,. . . ) more easily than ever, and it is the first one that can fully recognize all the incomplete substructures. The best-fit allocation is also proposed. The criterion aims at keeping the largest free parts from being destroyed, as is the philosophy of the best-fit allocation. Moreover, the proposed scheme can be performed in an injured RDIN with its processors and/or links faulty. Finally, the mathematical analysis and simulations for two instances, hypercubes and star graphs, of the RDIN are presented. The results show that the generalized scheme outperforms or is comparable to the other proprietary allocation schemes designed for the specific structure.},
keywords={},
doi={},
ISSN={},
month={April},}
부
TY - JOUR
TI - A Generalized Processor Allocation Scheme for Recursively Decomposable Interconnection Networks
T2 - IEICE TRANSACTIONS on Information
SP - 694
EP - 713
AU - Fan WU
AU - Ching-Chi HSU
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2002
AB - The Recursively Decomposable Interconnection Network (RDIN) is a set of interconnection networks that can be recursively decomposed into smaller substructures whose topologies and properties are similar to the original one. The examples of the RDIN are hypercubes, star graph, mesh, tree, pyramid, pancake, and WK-recursive network. This paper proposed a uniform and simple model to represent the RDIN inside computers at first. Based on the model, a generalized and efficient allocation scheme capable of being applied to all the members of the RDIN is developed. The proposed scheme can fully recognize the substructures (such as subcube, substar, subtree,. . . ) more easily than ever, and it is the first one that can fully recognize all the incomplete substructures. The best-fit allocation is also proposed. The criterion aims at keeping the largest free parts from being destroyed, as is the philosophy of the best-fit allocation. Moreover, the proposed scheme can be performed in an injured RDIN with its processors and/or links faulty. Finally, the mathematical analysis and simulations for two instances, hypercubes and star graphs, of the RDIN are presented. The results show that the generalized scheme outperforms or is comparable to the other proprietary allocation schemes designed for the specific structure.
ER -