Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering》 2006-01
Add to Favorite Get Latest Update

Minimum Deadlock-free Routing Restrictions and Deadlock-free Behavioral Routing Algorithm on Star Graph

WEN Xue,LIN Yaping,WANG Lei(College of Computer and Communication,Hunan University,Changsha 410082)  
The paper studies deadlock-free behavioral routing algorithm on star graph.First,two minimum deadlock-free routing restrictions on star graph are presented.Then the deadlock-free behavioral routing algorithm based on these two restrictions is presented.Finally,the paper proves that the deadlock-free routing restrictions presented in reference[4] is a specific example of the minimum deadlock-free routing restrictions presented in this paper.
【Fund】: 国家自然科学基金资助项目(60272051);; 湖南省自然科学基金资助项目(01JJY1007)
【CateGory Index】: TP338
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved