AN EFFICIENT DEADLOCK-AVOIDANCE ALGORITHM

被引：2
|
作者：
FINKEL, R
MADDURI, HH
机构：
[1] Univ of Wisconsin, Madison, WI, USA, Univ of Wisconsin, Madison, WI, USA
来源：
INFORMATION PROCESSING LETTERS | 1987年 / 24卷 / 01期
关键词：
COMPUTER PROGRAMMING - Algorithms;
D O I：
10.1016/0020-0190(87)90195-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The Banker's algorithm avoids deadlocks by requiring the existence of a safe sequence of job completions before granting any request. We generalize this safety test and calculate the minimum number of resources needed to assure that an allocation state is safe. We also introduce a data structure that remembers safe sequences across calls to the resource allocator. We derive an O(log n) safety test for n processes.
引用
收藏
页码：25 / 30
页数：6
相关论文
共 50 条
12345