本文已被：浏览 997次 下载 480次
投稿时间：1997-09-22
投稿时间：1997-09-22
中文摘要: 本文对星形图上路径算法的无死锁性问题进行了分析，给出了星形图上的两个无死锁受限条件和一个满足无死锁受限条件的路径算法．
Abstract:This paper studies the deadlock -frec behavior of routing algorithms on the star graphs.It presents two of the deadlock -free routing restrictions, and a algorithm that satisfies the deadlock -free routing restrictions.
keywords: star graph routing algorithm deadlock permutation cycle
文章编号：19970405 中图分类号： 文献标志码：
基金项目:国家自然科学基金
| Author Name | Affiliation |
| Shi Fengxian | |
| Xiong Pengrong | Shangrao Teache’s College |
| Zhou Yulin | Shangrao Teache’s College |
引用文本：
石凤仙,熊鹏荣,周玉林,等.星形图上路径算法的无死锁性[J].上海电力大学学报,1997,13(4):31-37.
Shi Fengxian,Xiong Pengrong,Zhou Yulin,et al.Deadlock-free Behavior of Routing Algorithm on Star Graph[J].Journal of Shanghai University of Electric Power,1997,13(4):31-37.
石凤仙,熊鹏荣,周玉林,等.星形图上路径算法的无死锁性[J].上海电力大学学报,1997,13(4):31-37.
Shi Fengxian,Xiong Pengrong,Zhou Yulin,et al.Deadlock-free Behavior of Routing Algorithm on Star Graph[J].Journal of Shanghai University of Electric Power,1997,13(4):31-37.