基于SYBASE SQL Server的页锁表锁及死锁研究

主要讨论了SYBASE SQL Server的锁，分析了引起死锁的各种可能性，并且提出了避免死锁产生、提升系统性能的实施方法。     

具有多项式时间复杂性的避免制造系统死锁控制策略

基于系统 Petri 网模型, 研究自动制造系统的避免死锁问题. 对不含中心资源的制造系统, 证明了它只包含安全和死锁两类可达状态. 通过一步向前看的方法, 给出了系统多项式时间复杂性的最佳避免死锁策略. 对一般系统定义了一种辅助 Petri 网. 利用辅助网的最佳避免死锁策略, 提出了综合一般制造系统多项式复杂性的避免死锁策略的方法.     

避免FMS死锁的控制策略

本文利用ＦＭＳ的Ｐｅｔｒｉ网模型讨论系统的死锁问题，给出了系统死锁的必要充分条件，提出了避免系统死锁的反馈控制策略，这种策略对系统的限制小，在许多情形下是最优的。     

城市监控报警联网系统的锁机制应用研究

城市监控报警联网系统是以实时、历史视频资源管理,各类报警联动业务处理,各类外部系统业务集成为主要功能的业务系统.业务功能相对复杂,视频点播等核心业务功能实时性、并发性要求较高.本文论述了锁机制在解决城市监控报警联网系统核心业务并发中的具体应用,以及在系统设计开发过程中避免死锁的一些方法措施.     

分布式锁管理在集群系统中的应用研究

集群系统可实现不间断实时数据处理,分布式锁管理可以为集群系统中的相互操作的进程提供同步访问共享资源的机制.同时避免死锁的发生.     

分布式系统死锁的预防、避免和检测

分布式系统涉及到资源和数据的高度共享,从而可能引发死锁。分布式系统的死锁是由于资源和通讯产生的。从分布式系统死锁产生的条件,解决策略,以及分布式系统中死锁预防、避免和检测的各种算法进行了具体阐述。     

处理死锁的几种策略

在多道程序系统中，多个程序并发执行，共享系统资源，若对资源的管理和使用不当，会导致系统死锁。死锁避免是解决死锁问题的常用方法，而银行家算法是最著名的死锁避免算法。用类C语言描述了多项资源银行家算法。     

Oracle数据库死锁问题研究

数据库是网络环境下多用户使用的共享资源,数据库在处理多线程大量数据存取过程中很可能出现死锁现象。文中介绍了Oracle数据库锁机制和死锁发生的原因,Oracle数据库检测死锁采用的相关视图。详细叙述了SQL语句检测死锁、死锁的定位方法和解决数据库死锁的方法。编写了在Linux环境中死锁检测脚本,模拟Oracle数据库死锁测试了脚本的正确性。实际应用表明该方法可以有效监测程序中的主要模块是否发生死锁,而且简单有效。     

优先级反转和死锁的资源管理模式研究与实现

为了抑制优先级反转现象,采用优先级继承协议来解决优先级反转现象,在此协议中不能避免系统死锁现象的发生。分析了死锁现象产生的原因的,在优先级继承协议基础上提出了优先级反转和死锁问题的资源管理模式,采用排序锁定共享资源的方法,使共享资源按照SourceID由低到高的共享顺序依次被访问。理论证明该方法在一定程度上抑制优先级反转且避免了死锁现象的发生,通过实验结果表明了解决优先级反转和死锁的资源管理模式的正确性与可行性。     

死锁的解法

本文主要研究由资源分配引起的死锁,说明资源的各种类型和基于资源分配的系统状态模型,给出了死锁形成的四个必要条件。分别对解决死锁的四个感兴趣的区域:死锁的预防、避免、探测和恢复进行较详细的分析和研究。     

Controller design and performance evaluation for deadlock avoidance in automated flexible manufacturing cells

In this paper, the design of a deadlock avoidance controller is described. The uncontrolled system is modeled using colored Petri nets. The system controller is based on a restrictive (not maximally permissive) deadlock avoidance policy to resolve deadlocks and control the real-time resource allocation decisions in the system. Performance evaluation of systems controlled by not maximally permissive algorithms is essential in determining the applicability and effectiveness of the control algorithms. The performance of the controlled system is compared with performance of optimal control policies to quantify the effects of the restrictiveness of the deadlock avoidance policy on system performance.     

分布式移动代理系统的异步死锁检测

移动代理技术在为分布式应用提供全新的网络计算方式的同时也产生了传统分布式计算领域所没有的新的交互模式和执行模式。传统分布式计算的处理方法如并发控制和死锁检测方法不再适用于客户和服务提供者都可在网络中随处移动的移动代理系统。通过移动代理来建模长寿事务,并根据移动代理的特点提出了一种异步分布式死锁检测和解除算法。它将事务代理的执行与死锁检测机制分离,用专门的代理负责死锁检测的初始化、检测和消除等工作。死锁的检测通过创建若干检测代理,使其在各个站点间移动来收集资源请求和分配信息,并据此构造全局等待图;通过分析和探测全局等待图中是否存在圈来完成。算法具有独立于网络的拓扑结构,死锁的检测和事务代理的执行异步操作,不对代理的移动性施加任何限制等特点。     

Detecting and resolving deadlocks in mobile agent systems

Mobile agents environment is a new application paradigm with unique features such as mobility and autonomy. Traditional deadlock detection algorithms in distributed computing systems do not work well in mobile agent systems due to the unique feature property of the mobile agent. Existing deadlock detection and resolution algorithms in mobile agent systems have limitations such as performance inefficiency and duplicate detection/resolution when multiple mobile agents simultaneously detect/resolve the same deadlock. To address these problems, we propose an improved deadlock detection and resolution algorithm that adopts priority-based technique and lazy reaction strategy. The priority-based technique aims to ensure that there is only one instance of deadlock detection and resolution, and it also helps reduce mobile agent movement and data traffic together with the lazy reaction strategy. The liveness and safety properties of the proposed algorithm are proved in this paper. Theoretical analysis and experimental results show that the proposed algorithm provides better performance in terms of agent movement, data traffic, and execution time.     

基于改进人工协调场的多机器人避碰算法

针对多机器人系统中避碰问题,提出一种基于改进人工协调场的多机器人避碰算法。首先采用凸化障碍,子目标主动选择方法,解决人工协调场在有非凸障碍环境中的“死锁”问题;其次建立基于速度和距离的排斥力模型,以克服人工协调场对空间利用率低的缺陷,尤其是目标点与障碍物距离较近机器人无法抵达的情况;最后设计一种力混合器模型,并基于此模型以达到避免人工协调场中的运动抖动的效果。仿真实验证明该算法对解决有障碍环境下多机器人避碰问题的有效性和可靠性,增强了多机器人系统对复杂环境的适应性。     

基于时戳的分布式数据库系统中的死锁预防策略

本文讨论了分布式数据库系统中基于时戳的死锁预防策略，分析了预防死锁问题的两种可行的动态优先级方案——等待一死亡方案和伤害一等待方案，提出了使用时戳的动态优先级死锁预防策略在解决分布式数据库系统并发控制的可行性和有效性，保证了产生死锁问题的条件不能发生，从而有效的预防了死锁，并给出了相应的实例。     

Deadlock avoidance schemes in a distributed robotic system: Petri net modeling and analysis

This article presents a Petri net-based approach to modeling and evaluating four different deadlock avoidance schemes for a distributed robotic system, i.e., a five-robot-five-assembly-line system. Among these four schemes are the conventional, full synchronization, global semaphore, and partial synchronization schemes. To explore such issues as the system performance and control structure complexity, this article conducts detailed Petri net modeling for this system and evaluates performance of the deadlock avoidance schemes using stochastic Petri nets. The interesting results presented include that: (1) any possible system deadlock can seriously degrade the system performance even if effective deadlock resolution techniques are available; (2) conservative use of resources is likely to be the best policy; and (3) higher resource utilization may not necessarily imply higher system production rate in a resource-sharing environment. The related results need to be further explored for the larger resource-sharing discrete event systems. © 1995 John Wiley & Sons, Inc.     

On the Optimality of Randomized Deadlock Avoidance Policies

This paper revisits the problem of selecting an optimal deadlock resolution strategy, when the selection criterion is the maximization of the system throughput, and the system is Markovian in terms of its timing and routing characteristics. This problem was recently addressed in some of our previous work, that (i) provided an analytical formulation for it, (ii) introduced the notion of randomized deadlock avoidance as a generalization of the more traditional approaches of deadlock prevention/avoidance, and detection and recovery, and (iii) provided a methodology for selecting the optimal randomized deadlock avoidance policy for a given resource allocation system (RAS) configuration. An issue that remained open in the problem treatment of that past work, was whether the proposed policy randomization is essential, i.e., whether there exist any RAS configurations for which a randomized deadlock avoidance policy is superior to any other policy that does not employ randomization. The work presented in this paper establishes that for the basic problem formulation where the only concern is the (unconstrained) maximization of the system throughput—or the other typical performance objectives of minimizing the system work-in-process and mean sojourn time—randomization of the deadlock resolution strategy is not essential. However, it is also shown that, sometimes, it can offer an effective mechanism for accommodating additional operational constraints, like the requirement for production according to a specified product mix. Furthermore, the undertaken analysis provides an analytical characterization of the dependence of the aforementioned performance measures on the transition rates relating to the various events of the underlying state space, which can be useful for the broader problem of synthesizing efficient scheduling policies for the considered class of resource allocation systems.     

Mobile agent-enabled framework for structuring and building distributed systems on the internet

Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the Internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of proc- essing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual ex- clusion in our previous work. In this paper, we use the framework to propose a novel ap- proach to detecting deadlocks in distributed system by using mobile agents, which dem- onstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD (Mobile Agent Enabled Deadlock Detection) scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detec- tion strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.     

操作系统中死锁问题的研究

主要研究操作系统进程的死锁问题。进程死锁问题是操作系统的主要问题之一,很多学者专家一直在研究怎样解决这个问题。首先提出了死锁的概念,死锁发生的原因及产生死锁的四个必要条件,然后又讨论了破坏死锁发生的必要条件,就能预防死锁的发生,最后具体的谈论了死锁避免的最著名的算法—银行家算法,从而阻止死锁的发生。