-
Notifications
You must be signed in to change notification settings - Fork 16
/
Copy path死锁.html
20 lines (19 loc) · 1.59 KB
/
死锁.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
<html>
<head>
<title>死锁</title>
<basefont face="微软雅黑" size="2" />
<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
<meta name="exporter-version" content="Evernote Windows/307425 (zh-CN, DDL); Windows/10.0.0 (Win64);"/>
<style>
body, td {
font-family: 微软雅黑;
font-size: 10pt;
}
</style>
</head>
<body>
<a name="705"/>
<h1>死锁</h1>
<div>
<span><div>死锁问题:</div><div><img src="死锁_files/Image.png" type="image/png" data-filename="Image.png"/></div><div>系统至少有13个资源 不会发生死锁！ 假设 有K 个进程 n个资源 则不发生死锁的资源数为 <span style="color: rgb(227, 0, 0);">k*(n-1)+1</span></div><div><br/></div><div><span style="font-size: 14pt;">死锁发生必要条件</span>：</div><div>1）互斥 2）保持和等待 3）不剥夺 4) 环路等待 这四个条件缺一不可就发生死锁</div><div><img src="死锁_files/Image [1].png" type="image/png" data-filename="Image.png"/></div><div><span style="font-size: 14pt;">死锁的预防</span><span style="font-size: 12pt;">:</span><span style="color: rgb(227, 0, 0);">打破四大条件</span>。</div><div><br/></div><div><span style="font-size: 14pt;">死锁的避免: </span></div><div><span style="font-size: 12pt;">1)有序资源分配 2）银行家算法</span></div><div><br/></div><div><span style="font-size: 14pt;">银行家算法:</span></div><div><img src="死锁_files/Image [2].png" type="image/png" data-filename="Image.png" style="font-size: 14pt;"/></div><div><br/></div></span>
</div></body></html>