文件名称:allocation
-
所属分类:
- 标签属性:
- 上传时间:2015-05-12
-
文件大小:929.12kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
There are three methods for handling deadlocks in resource allocation systems deadlock
prevention, deadlock avoidance and deadlock detection combined with recovery. Of these three
methods deadlock avoidance is preferable in many cases but seldom used on account of its high
cost. We present a simple modification of a known deadlock avoidance algorithm, the banker s
algorithm, which has a running time O(mn 2) in a system consisting of n processes and m
different types of resources. Our modified algorithm gives an amortized worst case running time of
O(mn) under certain likely conditions and in that way it can be considered a competitive method
for handling deadlocks. At worst, our algorithm is twice as fast as the banker s algorithm,
prevention, deadlock avoidance and deadlock detection combined with recovery. Of these three
methods deadlock avoidance is preferable in many cases but seldom used on account of its high
cost. We present a simple modification of a known deadlock avoidance algorithm, the banker s
algorithm, which has a running time O(mn 2) in a system consisting of n processes and m
different types of resources. Our modified algorithm gives an amortized worst case running time of
O(mn) under certain likely conditions and in that way it can be considered a competitive method
for handling deadlocks. At worst, our algorithm is twice as fast as the banker s algorithm,
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Banker's Algorithm.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.