请输入您要查询的英文单词:

 

单词 Circular wait
释义

Circular wait

中文百科

死锁 Deadlock

(重定向自Circular wait)
P1、P2两个process都需要资源才能继续运行。P1拥有资源R2、还需要额外资源R1才能运行;P2拥有资源R1、还需要额外资源R2才能运行,两边都在互相等待而没有任何一个可运行。
Four processes (blue lines) compete for one resource (grey circle), following a right-before-left policy. A deadlock occurs when all processes lock the resource simultaneously (black lines). The deadlock can be resolved by breaking the symmetry.
Two processes competing for two resources in opposite order. 
(A) A single process goes through. 
(B) The later process has to wait. 
(C) A deadlock occurs when the first process locks the first resource at the same time as the second process locks the second resource. 
(D) The deadlock can be resolved by cancelling and restarting the first process.

死锁英语:Deadlock),又译为死结,计算机科学名词。当两个以上的运算单元,双方都在等待对方停止运行,以取得系统资源,但是没有一方提前退出时,这种状况,就称为死结。在多任务操作系统中,操作系统为了协调不同行程,能否取得系统资源时,为了让系统运作,就必须要解决这个问题。

这里指的是进程死锁,是个计算机技术名词。它是操作系统或软件运行的一种状态:在多任务系统下,当一个或多个进程等待系统资源,而资源又被进程本身或其它进程占用时,就形成了死锁。有个变种叫活锁。

英语百科

Deadlock 死锁

(重定向自Circular wait)
Both processes need resources to continue execution. P1 requires additional resource R1 and is in possession of resource R2, P2 requires additional resource R2 and is in possession of R1; neither process can continue.
Four processes (blue lines) compete for one resource (grey circle), following a right-before-left policy. A deadlock occurs when all processes lock the resource simultaneously (black lines). The deadlock can be resolved by breaking the symmetry.
Two processes competing for two resources in opposite order. 
(A) A single process goes through. 
(B) The later process has to wait. 
(C) A deadlock occurs when the first process locks the first resource at the same time as the second process locks the second resource. 
(D) The deadlock can be resolved by cancelling and restarting the first process.

(A) Two processes competing for one resource, following a first-come, first-served policy. 


(B) A deadlock occurs when both processes lock the resource simultaneously. 


(C) The deadlock can be resolved by breaking the symmetry of the locks. 


(D) The deadlock can be prevented by breaking the symmetry of the locking mechanism.

In concurrent programming, a deadlock is a situation in which two or more competing actions are each waiting for the other to finish, and thus neither ever does.

In a transactional database, a deadlock happens when two processes each within its own transaction updates two rows of information but in the opposite order. For example, process A updates row 1 then row 2 in the exact timeframe that process B updates row 2 then row 1. Process A can't finish updating row 2 until process B is finished, but process B cannot finish updating row 1 until process A is finished. No matter how much time is allowed to pass, this situation will never resolve itself and because of this, database management systems will typically kill the transaction of the process that has done the least amount of work.

随便看

 

英汉双解词典包含3607232条英汉词条,基本涵盖了全部常用单词的翻译及用法,是英语学习的有利工具。

 

Copyright © 2004-2022 Newdu.com All Rights Reserved
京ICP备09058993号 更新时间:2025/5/19 18:58:40