• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.230-236
• /
• 2022

Objectives: The primary goal of this article is to compare the multiple algorithms used for deadlock handling methods and then outline the common method in deadlock handling methods. Methods: The article methodology begins with introducing a literature review studying different algorithms used in deadlock detection and many algorithms for deadlocks prevented, recovered, and avoided. Discussion and analysis of the literature review were done to classify and compare the studied algorithms. Findings: The results showed that the deadlock detection method solves the deadlock. As soon as the real-time deadlock detection algorithm is identified and indicated, it performs better than the non-real-time deadlock detection algorithm. Our novelty the statistics that we get from the percentages of reviewing outcomes that show the most effective rate of 47% is in deadlock prevention. Then deadlock detection and recovery with 28% finally, a rate of 25% for deadlock avoidance.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.7
• /
• pp.677-682
• /
• 2007

Concurrent competition for finite resources by multiple parts in flexible manufacturing systems(FMS's) and inappropriate initial marking or net structure of Petri net with share resources results in deadlock. This is an important issue to be addressed in the operation of the systems. Deadlock is a system state so that some working processes can never be finished. Deadlock situation is due to a wrong resource allocation policy. In fact, behind a deadlock problem there is a circular wait situation for a set of resources. Deadlock can disable an entire system and make automated operation impossible. Particularly, an unmanned system cannot recover from such a status and a set of jobs waits indefinitely for never-to-be-released resources. In this paper, we proposed a deadlock prevention method using siphon and trap of Petri net. It is based on potential deadlock which are siphon that eventually became empty. This method prevents the deadlock by the control of transition fire and initial marking in the Petri net. An given example of FMS is shown to illustrate our results with deadlock-free.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.8
• /
• pp.706-712
• /
• 2002

In general, a deadlock in flexible manufacturing systems (FMSs) is caused by a resource limitation and the diversity of routings. However, the deadlock of industrial controllers such as programmable logic controllers (PLCs) can occur from different causes compared with those in general FMSs. The deadlock of PLCs is usually caused by an error signal between PLCs and manufacturing systems. In this paper, we propose a deadlock detection and recovery (DDR) algorithm to resolve the deadlock problem of PLCs at design stage. This paper employs the MAPN (modified automation Petri net), MTPL (modified token passing logic), and ECC (efficient code conversion) algorithm to model manufacturing systems and to convert a Petri net model into a desired LD (ladder diagram). Finally, an example of manufacturing systems is provided to illustrate the proposed DDR algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.443-451
• /
• 2001

This paper addresses an on-line scheduling method for track systems in semiconductor fabrication. A track system is a clustered equipment performing photolithography process in semiconductor fabrication. Trends toward high automation and flexibility in the track systems accelerate the necessity of the intelligent controller that can guarantee reliability and optimize productivity of the track systems. This paper proposes an-efficient on-line scheduling method that can avoid deadlock inherent to track systems and optimize the productivity. We employ two procedures for the on-line scheduling. First, we define potential deadlock set to apply deadlock avoidance policy efficiently. After introducing the potential deadlock set, we propose a deadlock avoidance policy using an on-line Gantt chart, which can generate optimal near-optimal schedule without deadlock. The proposed on-line scheduling method is shown to be efficient in handling deadlock inherent to the track systems through simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.561-572
• /
• 2002

Deadlock detection in distributed systems is considered difficult since no single site knows the exact information on the whole system state. This paper proposes a time-efficient algorithm for distributed deadlock detection and resolution. The initiator of the algorithm propagates a deadlock detection message and builds a reduced wait-for graph from the information carried by the replies. The time required for deadlock detection is reduced to half of that of the other algorithms. Moreover, any deadlock reachable from the initiator is detected whereas most previous algorithms only find out whether the initiator is involved in deadlock. This feature accelerates the detection of deadlock. Resolution of the detected deadlock is also simplified and precisely specified, while the current algorithms either present no resolution scheme or simply abort the initiator of the algorithm upon detecting deadlock.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1153-1156
• /
• 1987

This paper presents a distributed algorithm for deadlock detection in distributed computing system. The deadlock could be detected optimally from cycle. This algorithm maintains the Process-Resource Table and it could be found the deadlock from the table.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.58
• /
• pp.49-58
• /
• 2000

In order to resolve a deadlock problem in manufacturing systems, three main methods have been proposed-prevention, avoidance, and recovery. The prevention and avoidance methods require predicting deadlocks in advance in order to prohibit them. In contrast, the recovery method allows a system to enter a deadlock state, then resolves it usually using a common buffer. In this paper, a deadlock recovery method considering the impact of flexible job routings is proposed. This method is based on capacity-designated directed graph (CDG) model representing current requesting and occupying relations between Jobs and resources in order to detect a deadlock and then recovers it.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2298-2300
• /
• 2003

본 논문은 페트리 네트의 특별한 구조인 siphon의 특성을 이용하여 트랜지션 점화를 제어함으로써 deadlock을 회피하는 방법을 제시한다. 제안한 방법은 페트리 네트에서 상태 방정식을 유도한 후, siphon의 특성을 이용하여 deadlock을 회피할 수 있는 충분 조건을 유도한다. 간단한 FMS의 예를 이용하여 제안한 방법을 사용하면 deadlock이 발생하지 않음을 보인다.

• The Journal of Engineering Research
• /
• v.1 no.1
• /
• pp.49-57
• /
• 1997

In this paper, the follow-up works of Habermann's deadlock avoidance algorithm is investigated from the view of correction, efficiency and concurrency. Habermann's deadlock avoidance algorithm is briefly surveyed and in-depth discussion of follow-up algorithms modified and improved is presented. Then, further improvement of Kameda's algorithm will be discussed. His algorithm for testing deadlock-freedom in computer system converts the Habermann's model into a labeled bipartite graph so that the deadlock detection problem can be equivalent to finding complete matching for Mormon marriage problem. His algorithm has a running time of O($mn^1.5$) because Dinic's algorithm is used. The speed of above algorithm can be enhanced by employing a faster algorithm for finding a maximal matching. The wave method by Kazanov is used for.