deadlock-free
英 [ˈdedlɒk friː]
美 [ˈdedlɑːk friː]
网络 无死锁; 死的; 无死锁的; 无死结
双语例句
- A model of multicast communications is proposed for NoC ( networks on chip) to provide communications to guarantee deadlock-free routing.
文章提出了一种针对片上网络的组播通信模型，能够为片上网络提供无死锁的通信。 - Concurrent Code Design Method Base on Critical Path and Deadlock-free
基于关键路径与无死锁的DSP代码并行设计方法 - The results obtained show that not all of the strict minimal siphons need to consider when one designs deadlock-free Petri net models, and hence the design results and control algorithms are simplified.
结果表明，在设计无死锁的Petri网模型时，不是所有的严格极小信标都要考虑，从而简化了设计结果和控制算法。 - DBFC: Dimensional Bubble Flow Control with Deadlock-Free and Fully Adaptive Routing in the K-ary N-cube Network
K-aryn-cube网络中的维度气泡流控与无死锁完全自适应路由 - Second, by employing the common virtual network dividing technique, a new routing algorithm is presented, which is proved to be deadlock-free.
针对原有算法的特点，提出了一种新的无死锁路由算法并给出了无死锁证明。 - Deadlock-free modular supervisory control with partial observations
带有部分可观察的无死锁模监控 - Then the deadlock-free behavioral routing algorithm based on these two restrictions is presented.
此外，本文还提出了星形图上两类基于单缓冲和双缓冲技术的无死锁受限条件，并给出了相应的无死锁路径算法。 - The problem is rarely studied and we propose a deadlock-free supervisor synthesis method on bounded Petri nets.
此类问题鲜有研究，本文针对有界网给出了无死锁的监控器综合方法。 - Based on the analysis of the dependence among the multicast messages, the paper introduces the necessary and sufficient conditions for wormhole deadlock-free tree-based multicast.
本文在对树型多播过程中消息依赖关系分析的基础上，给出了基于虫孔交换的树型多播无死锁的充要条件。 - An Analysis of the Necessary and Sufficient Conditions for Wormhole Deadlock-Free Tree-Based Multicast
基于虫孔交换的树型多播无死锁充要条件分析 - Deadlock-free scheduling method for automated production cell including buffer
考虑缓冲区的自动生产单元的无死锁调度策略 - In this paper, an efficient algorithm for finding an optimal deadlock-free scheduling in a manufacturing system with very limited buffer is presented.
本文提出一种在制造系统（带有限缓冲区）中搜索最优的无死锁调度算法。 - The data transfer path from the calculation of this algorithm is the shortest deadlock-free transfer path.
根据该算法得出的数据传输路径是无死锁的最短传输路径。 - We study one of the key point in interconnection network, theory of deadlock-free.
本文对高性能计算机互连网络中的死锁避免理论进行了研究。 - This algorithm is based on the effective Genetic Algorithm ( GA) search method, and graph theory is introduced to assure deadlock-free.
此算法建立在遗传算法的基础上，运用图论算法来保证无死锁调度结果。 - A deadlock-free scheduling strategy for automated production cell
自动生产单元的无死锁调度策略 - Thus, a minimal routing algorithm based on the turn model is presented, which leads to a deadlock-free algorithm when incorporating the virtual network dividing technique.
该算法利用将物理通道分成两条虚通道进而形成两个不相交的虚拟网络，将不同的点对之间的路由限定在某一个虚拟网络中，从而有效地避免了死锁的产生。 - Deadlock-free operation of AGV systems by using colored Petri net model
着色Petri网模型实现AGV系统无死锁运行 - The evolving model of tools flow state is built up, and the states of tools flow deadlock and tools flow deadlock-free unsafe are defined.
建立了刀具流状态演变模型，给出了刀具流死锁状态及无死锁不安全状态的定义。 - Based on elementary siphon theory, the deadlock prevention method can solve the deadlock problems in shipping traffic systems theoretically. Then a deadlock-free shipping traffic system can be obtained.
通过基于基本信标的死锁预防算法对模型进行分析，从理论上解决了航行中的死锁问题，从而得到无死锁的船运交通系统模型。 - Traditional strategy for deadlock prevention is based on Petri net, with the idea of preventing all the strict minimal siphons from being emptied, so as to make the system deadlock-free.
传统的基于Petri网的死锁预防策略是控制网系统中的所有严格极小信标不被清空使得系统无死锁的思想。 - This is basic for tool flow heuristic scheduling. Secondly, cutting tools life is considered as a factor to rich and enhance tool flow scheduling theory and technique based on tool flow deadlock-free scheduling on the condition of procedure provisioning tools.
其次，在以往工序备刀前提下的刀具流无死锁调度工作基础上，进一步将刀具寿命考虑进来，从而丰富和完善了现有刀具流相关调度理论与技术。 - Tool flow deadlock-free heuristic scheduling algorithm in case of procedure provisioning tools is built up with the method of combination double-layer deadlock avoidance strategy and scheduling rules, and the handling tactics of tools failure are given.
将两层死锁避免策略与调度规则相结合，最终建立了工序备刀下的刀具流无死锁启发式调度算法，并给出了刀具失效的处理策略，仿真结果表明了该算法的有效性。 - After a sufficient condition of the deadlock-free design has been given, the directory-based invalidate cache coherence protocol is introduced and its cache coherence is verified using belief.
在避免系统死锁的前提下，设计了基于目录的无效使能协议，并证明其保证了缓存一致性。 - Setting the net to be deadlock-free by configuring the initial marking according to the constraints group is illustrated for designing and modifying the system model.
在设计和调整网模型时，根据约束条件来重新配置初始标识，使网模型无死锁的方法也结合实例在本文中做了详细介绍。 - The algorithm has characteristics of high throughput, low delay, strong adaptability and deadlock-free.
该算法具有高吞吐、低时延、自适应性强、无死锁的特点。 - If all the strict minimal siphons are controlled, then the entire system will be deadlock-free.
研究表明，只要网系统中所有的严格极小信标被控制，整个网系统就不会出现死锁现象。