Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks

被引:0
|
作者
Ahmed Nazeem
Spyros Reveliotis
机构
[1] United Airlines,School of Industrial, Systems Engineering
[2] Georgia Institute of Technology,undefined
来源
关键词
Reader/writer locks; Deadlock; Parallel programming; Supervisory control; Discrete event systems; Right-closed sets;
D O I
暂无
中图分类号
学科分类号
摘要
This paper extends the existing theory on maximally permissive liveness-enforcing supervision of resource allocation systems (RAS) so that it can handle RAS with reader / writer (R/W-) locks. A key challenge that is posed by this new RAS class stems from the fact that the underlying state space is not necessarily finite. We effectively address this obstacle by taking advantage of special structure that exists in the set of inadmissible states and enables a finite representation of this set through its minimal elements.
引用
收藏
页码:31 / 63
页数:32
相关论文
共 50 条