deadlock-free 中文意思是什麼
deadlock-free
解釋
無死鎖的-
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的情況。 -
Method and simulation of deadlock free resource co - allocation in simulation - grid
模擬網格中預防死鎖的資源分配方法及其模擬分析 -
The processors overlapping along the boundaries of different fault regions is allowed. the proposed algorithm, which routes the messages by x - y routing algorithm in fault - free region, can tolerate convex fault - connected regions with only two virtual channels per physical channel, and is deadlock - and livelock - free. the proposed algorithm can be easily extended to adaptive routing
本文的主要貢獻是提出了一套基於真值表的形式化的故障區域邊界的配置方法，每一個節點只需要知道它的八鄰接節點是正常節點或故障節點就可以配置故障區域的邊界，路由信息能應用該邊界繞道故障區域。
分享友人