必应词典为您提供deadlock-freedom的释义,网络释义: 无死锁;死锁自由度;
Proof of deadlock freedom and livelock freedom is presented. 部分自适应的NPN和确定性的IDO都是无死锁,无活锁且最短的路由算法。6) minimal deadlock-free fully-adaptive routing 最短路径无死锁全自适应路由补充资料:开东园路北至山脚因治路傍隙地杂植花草 【诗文】:避俗从来恨不深,家园栽种偶成阴。西...
ACMOuri Wolfson , Mihalis Yannakakis, Deadlock-freedom (and saftey) of transactions in a distributed database, Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.105-112, March 25-27, 1985, Portland, Oregon, United States [doi>10.1145/325405.325418]...
In calculi for concurrency, this property admits several formalizations; two of them are deadlock freedom and lock freedom. Intuitively, deadlock freedom ensures that communications will eventually succeed unless the whole process diverges [38]; lock freedom is a stronger property: it guarantees that...
Deadlock-freedom-by-design: Multiparty Asynchronous Global Programming Over the last decade, global descriptions have been successfully employed for the verification and implementation of communicating systems, respectively as... CF Montesi - 《Acm Sigplan Notices A Monthly Publication of the Special ...
Parameterized Verification of Deadlock Freedom in 青云英语翻译 请在下面的文本框内输入文字,然后点击开始翻译按钮进行翻译,如果您看不到结果,请重新翻译! 翻译结果1翻译结果2翻译结果3翻译结果4翻译结果5 翻译结果1复制译文编辑译文朗读译文返回顶部 死锁自由中的参数化的验证...
Deals with the development of techniques for proving deadlock freedom for wormhole routing, a switching technique in distributed memory multiprocessors, algorithms. Application of unreachable cyclic configurations to oblivious routing algorithms; Assumptions and definitions for wormhole routing; Required condition...
In this paper we present a novel approach to topology discovery and defect mapping in nano-scale self-assembled DNA networks. The large scale randomness and irregularity of such networks makes it necessary to achieve deadlock freedom without the availability of a topology graph or any other kind ...
GP roc D is obtained from GP roc by adding specification information to the objects which is strong enough to guarantee deadlock-freedom. The main technical contribution is to show that this can be done in a way which is preserved by composition. The methods used to achieve this can be ...
A basic property which distributed communicating systems have to fulfill is deadlock-freedom. For systems consisting of the parallel composition of subsystems it is complex to check deadlock-freedom because the global state space of the composition has to be investigated. ...