摘要
对于动态传输路径，给出了每个结点至少两个缓冲的信息转接网死锁避免问题，所提出的死锁避免算法从缓冲利用的角度看是优化的同时给出了死锁无关的证明及其条件。
A problem of deadlock avoidence methods in store and forward networks with at least two buffers per node for dynamic routing path is discussed The deadlock free algorithms proposed is optimal in the sense of possible buffers utilization, and the proof and conditions are shown for deadlock free, which is profitable for the problem of parallel computation processing
出处
《哈尔滨理工大学学报》
CAS
1997年第5期45-49,共5页
Journal of Harbin University of Science and Technology
基金
黑龙江省自然科学基金
