Processor Allocation for Recusively Decomposable Interconnection Networks

• Main Authors: Wu, Fan, 吳帆
• Other Authors: Ching-chi Hsu
• Format: Others
• Language: en_US
• Published: 1998
• Online Access: http://ndltd.ncl.edu.tw/handle/11919977158116411782

博士 === 國立臺灣大學 === 中國文學系 === 86 === 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, tree, pyramid, pancake, and WK-recursive network. This paper proposed an 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 the incomplete substructure. The best-fit substructure allocation is also proposed. The criterion is to aim at keeping the largest free parts from being destroyed, as is the philosophy of the best- fit allocation. Moreover, all the proposed scheme can be performed in the injured RDIN with its processors and/or links faulty. Finally, the mathematical analyses 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.