deadlock-free meaning in Chinese
无死锁的
Examples
- The deadlock - free behavioral routing algorithm on star graph
星形图上无死锁的路径算法 - We study one of the key point in interconnection network , theory of deadlock - free . we focus on the wormhole switching deadlock - free theory in interconnection network , and a new design method based on hybrid switching is proposed , which provides a fine way to realize deadlock - free routing algorithm
重点对采用虫孔路由的直接网络无死锁问题进行了研究，在深入分析大量已有算法和无死锁理论的基础上，设计混合切换技术下的无死锁路由算法，给出了无死锁路由设计的一个可行途径。 - We study the design of routing algorithm . after analyzing the characteristics of message routing in the interconnection network , one new concept " the best network for routing " ( bnr ) is proposed . base on it , we present the framework for designing high performance minimal deadlock - free fully adaptive routing algorithms
基于“最佳寻径网”框架，以低通信延迟、高通信带宽和易vlsi实现为目标，设计了自适应性强、可扩展性好、性能优越的bbfam ( bnr - basedfully - adaptivealgorithmonmesh )完全自适应路由算法。 - In wormhole meshes , a reliable routing is supposed to be deadlock - free and fault - tolerant . many routing algorithms are able to tolerate a large number of faults enclosed by rectangular blocks or special convex , none of them , however , is capable of handling two convex fault regions with distance two by using only two virtual networks
在应用虫孔路由的mesh结构的多处理机系统中，已经有许多基于维数序的容错的路由算法被提出，其中大多数路由算法只能容忍矩型或凸型的故障节点组成的区域，但是，至今还没有一个算法能应用两个虚拟信道处理凸型convex故障区域距离大于和等于2的情况。