http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
하이퍼큐브에서 Tree - Exchange 기법을 이용한 서브큐브의 동적할당
류동원(Dong-Won Lyu),손유익(Yoo-Ek Son) 한국정보과학회 1994 한국정보과학회 학술발표논문집 Vol.21 No.1
This paper proposes a new fully-recognizable allocation strategy in the hypercube. The algorithm, called the Exchange Algorithm, developed in the strategy exchanges nodes through min(n-k, k) steps to search all subcubes, recognizes more subecubes than other strategies, and executes complete full recognition. The implementaion details of the algorithm are described. Finally the results are analysed and compared by computer simulation.
A Full Recognition Strategy for Processor Allocation in Hypercube Multiprocessors
류동원,손유익 계명대학교 산업기술연구소 1993 産業技術硏究所 論文報告集 Vol.16 No.1
The hypercube interconnection networks is considered as a good parallel architecture for a large class of flexible and powerful networks in large-scale parallel computing. Processors must be allocated to incoming tasks in a way that will maximize the processors utilization and minimize the system fragmentation. In order to achieve this goal, it is necessary to detect the availability of a subcube of required size and merge the released small cubes to form a larger ones. In this paper, we describe the existing strategies for subcube allocation in an n-cube multiprocessors and then propose a new fully-recognizable allocation strategy with [2??+(??)×n] search space in comparison with [(??)×(2??-1)+2??] in binary tree of the TC strategy in generating the search space, while achieving complete subcube recognition. The implementation details of the algorithms are also described.