论文部分内容阅读
星形图具有许多良好的拓扑性质，是一种有可能替代传统的超立方体的并行计算互联网络的模型．在本文中，作者针对在星形图这样一种高度规则的网络中，可能产生死锁的问题，对星形图上无死锁的路径算法进行了研究．首先利用星形图中匹配基的性质，给出了从Sn（B）到Sk的正规映射的定义，然后提出了星形图上的两个无死锁受限条件，最后证明了一个满足无死锁受限条件的路径算法．作者还提出了星形图上路径算法的最小无死锁受限条件等，有待于进一步研究．
The star graph has many good topological properties and is a model of parallel computing interconnects that may replace traditional hypercubes. In this paper, the authors study a deadlock-free path algorithm on a star graph for a highly regular network such as a star graph. Firstly, the definition of normal mapping from Sn (B) to Sk is given by using the properties of the matching basis in the star graph. Then two deadlock-free conditions on the star graph are presented. Finally, Path Algorithm of Deadlock Restricted Conditions. The author also proposes the minimum deadlock-free conditions of the path algorithm on the star graph, which needs further study.