首页> 外文期刊>Computer Journal, The >Fewer Monitors and More Efficient Controllability for Deadlock Control in S3PGR2 (Systems of Simple Sequential Processes with General Resource Requirements)
【24h】

Fewer Monitors and More Efficient Controllability for Deadlock Control in S3PGR2 (Systems of Simple Sequential Processes with General Resource Requirements)

机译:S 3 PGR 2 (具有一般资源要求的简单顺序过程系统)中的死锁控制更少的监视器和更有效的可控制性

获取原文
获取原文并翻译 | 示例
           

摘要

Concurrent systems such as distributed operating systems, distributed database systems, flexible manufacturing systems (FMS) etc. employ multiple processors to speed up the execution. However, to fully utilize the resources involved, the competition for resources among processes is strong and often leads to deadlocks where the whole system completely stops. Petri nets have been widely used to model concurrent systems and the associated deadlocks, which arise due to insufficiently marked siphons. A siphon is a structure object or a set of places; once these places become unmarked, they stay so afterwards making their output transitions permanently dead. To avoid deadlocks, monitors and control arcs are added upon problematic siphons, the number of which grows exponentially with the size of the net modeling the FMS. Li and Zhou relieved the problem by adding monitors only to elementary siphons. First, they test the marking linear inequality (MLI). If it fails, then they perform a linear integer programming test which takes exponential time. Thus, the MLI test is only a sufficient (not necessary) one. For systems of simple sequential processes with general resource requirements, there is one additional problem. That is, even though a siphon is not a dependent siphon based on the definition by Li and Zhou, the siphon may become controlled after controlling some elementary siphons. We develop new theory to turn this elementary siphon into a dependent one, thus reducing the number of monitors and simplifying the control hardware. This makes the uncontrolled model less disturbed and hence the controlled system becomes more permissive. Furthermore, we derive the exact controllability (both sufficient and necessary) so that the subsequent integer programming test can be eliminated. As a result, the total time complexity to check controllability of all strongly dependent siphons is reduced from exponential to linear if all n=2 strongly dependent siphons need to be verified against our new MLI test, the number of which is polynomial.
机译:诸如分布式操作系统,分布式数据库系统,柔性制造系统(FMS)等并发系统采用多个处理器来加快执行速度。但是,为了充分利用所涉及的资源,进程之间对资源的竞争很激烈,并且常常导致整个系统完全停止的死锁。 Petri网已被广泛用于对并发系统和相关死锁进行建模,死锁是由于虹吸标记不足而引起的。虹吸管是一个结构对象或一组位置;一旦这些地方变得无标记,它们就会留在原处,从而使输出过渡永久消失。为避免死锁,在有问题的虹吸管上添加了监视和控制弧,虹吸管的数量随模拟FMS的网的大小呈指数增长。李和周通过仅在基本虹吸管上增加显示器来缓解了这一问题。首先,他们测试标记线性不等式(MLI)。如果失败,则他们执行线性整数编程测试,该测试花费了指数时间。因此,MLI测试仅是足够的(不是必需的)测试。对于具有一般资源需求的简单顺序过程的系统,存在另一个问题。也就是说,即使虹吸不是基于Li和Zhou的定义的从属虹吸,也可以在控制一些基本虹吸后控制虹吸。我们开发了新的理论,可以将这种基本的虹吸管变成一个相关的虹吸管,从而减少了监视器的数量并简化了控制硬件。这使得不受控制的模型受到的干扰较小,因此受控制的系统变得更加宽松。此外,我们得出精确的可控制性(充分和必要),以便可以消除后续的整数编程测试。结果,如果需要针对我们新的MLI测试(其数量为多项式)来验证所有n = 2个高度相关的虹吸管,则检查所有高度相关的虹吸管的可控性的总时间复杂度将从指数降低为线性。

著录项

  • 来源
    《Computer Journal, The》 |2010年第10期|p.1783-1798|共16页
  • 作者

    Daniel Y. Chao;

  • 作者单位

    Corresponding author: ,;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号