• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.475-481
• /
• 2009

The frequency and probability of deadlock are influential factors in the design of algorithms for deadlock. However, little work has been done in this area because it's not easy to analyze how factors such as the characteristics of process or resource, resource request and release patterns, or the number of process affect the occurrence of deadlock. This study was designed to reduce remarkably the number of state by adapting the model 'state (a,b)t' to represent the resource allocation state, as well as to include the effect of resource error rate and recovery rate in the system analysis. Various formulas about deadlock occurrence were resulted in this study such as the average time interval of deadlock, the probability that a process requesting a resource waits or deadlocks, and the probability that a request deadlocks in a cycle of length 2.

• Journal of Navigation and Port Research
• /
• v.42 no.1
• /
• pp.47-56
• /
• 2018

In this study, the focus is on the issue of whether a container terminal is facing the limitation of its productivity for serving mega-vessels with numerous containers. In order to enhance the terminal operations, a new conceptual design of the container handling system have been proposed. This research focuses on the rail-based container transport system and its operations. This system consists of rail-based shuttle cranes and rail-based transporters called flatcars. The deadlock problem for managing automated transporters in container terminals has been an important issue for a long measurement of time. Therefore, this study defines the deadlock situation and proposes its avoidance rules at the rail-based container transport system, which is required to handle numerous container throughput operations. The deadlock in the rail-based container transport system is classified into two parts: deadlock between cranes and flatcars; deadlock between flatcars. We developed the simulation model for use with characterizing and analyzing the rail-based container transport system. By running the simulation, we derived possible deadlock situations, and propose the several deadlock avoidance algorithms to provide results for these identified situations. In the simulation experiments, the performances of the deadlock avoidance algorithms are compared according to the frequency of deadlocks as noted in the simulations.

• Journal of the Korea Society for Simulation
• /
• v.17 no.3
• /
• pp.75-83
• /
• 2008

A deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop and it is one of the important problems in process control system to detect and prevent deadlocks. While the reachability analyze methods or divide subnets for analyzing methods are well used, it requires a lot of times and effects to analyze the detection of the deadlock status. Furthermore, it could not be effective if the model is complex or huge. Therefore, it is necessary to develop a new and more efficient deadlock detection algorithm. In this paper, a deadlock detection conditions after analyzed the Petri Net using the transitive matrix has been proposed to solve these problems. For presenting the results, the suggested deadlock detection algorithm was also adapted to an illustrated FMS (Flexible Manufacturing System) model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.528-537
• /
• 2008

This paper proposes a dynamic job distribution algorithm in a hybrid NoC structure which can improve system network performance by reducing deadlock and packet drop rate for various multimedia applications. The proposed job distribution algorithm schedules every job to the sub-cluster where packet drop rate can be minimized for each multimedia application program. The proposed Job distribution algorithm and network topology targets multimedia applications frequently used in modern embedded systems, such as MPEG4 and MP3 decoder, GPS positioning system, and OFDM demodulator. Experimental results show that packet drop rate was reduced by about 13.0%, and chip area was increased by about 2.7% compared to the APSRA algorithm. When compared to the XY algorithm popularly used for benchmarking, the packet drop rate was reduced by about 23.9%, while chip area was increased by about 3.0%.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.8
• /
• pp.585-593
• /
• 2004

Fault-tolerant gait planning in legged locomotion is to design gaits with which legged robots can maintain static stability and motion continuity against a failure in a leg. For planning a robust and deadlock-free fault-tolerant gait, kinematic constraints caused by a failed leg should be closely examined with respect to remaining mobility of the leg. In this paper, based on the authors's previous results, deadlock avoidance scheme for fault-tolerant gait planning is proposed for a hexapod robot walking over even terrain. The considered fault is a locked joint failure, which prevents a joint of a leg from moving and makes it locked in a known position. It is shown that for guaranteeing the existence of the previously proposed fault-tolerant tripod gait of a hexapod robot, the configuration of the failed leg must be within a range of kinematic constraints. Then, for coping with failure situations where the existence condition is not satisfied, the previous fault-tolerant tripod gait is improved by including the adjustment of the foot trajectory. The foot trajectory adjustment procedure is analytically derived to show that it can help the fault-tolerant gait avoid deadlock resulting from the kinematic constraint and does not make any harmful effect on gait mobility. The post-failure walking problem of a hexapod robot with the normal tripod gait is addressed as a case study to show the effectiveness of the proposed scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.71-74
• /
• 2000

Due to the complexity of parts flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A grouping heuristic to solve the buffer allocation problem is proposed. Computer simulation using Arena will be experimented to show the validation of the proposed algotithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.668-671
• /
• 2003

A concept of deadlock point of fuzzy sequential circuit is proposed. There are six cases of fuzzy sequential circuits of 1 state and 1 input variables with deadlock points. Examples of each case are shown both in a form of characteristic equation and in a graphical illustration. As fuzzy sequential circuit with 1 state and 1 input variables, D and T fuzzy flip-Hops are also characterized using the proposed concept. Thus one of the four types of D fuzzy Hip-Hops and T fuzzy Hip-flop have a deadlock point 1/2.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.213-220
• /
• 2008

The object of this paper is to propose a method to deal with the problem of modeling user specifications in approaches based on supervisory control and Petri nets. However, most of Petri Net approaches are based on forbidden states specifications, and these specifications are suitable the use of tool such as the reachability graph. But these methods were not able to show the user specification easily and these formalisms are generally limited by the combinatorial explosion that occurs when attempting to model complex systems. Herein, we propose a new efficient method using FSSTP (Forbidden Sequences of State-Transitions Problem) and theory of region. Also, to detect and avoid the deadlock problem in control process, we use DAPN method (Deadlock Avoidance Petri nets) for solving this problem in control model.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.344-352
• /
• 2005

The modem production systems are required to produce many items. This is due to the fact that society has become more complex and the customers' demands have become more varied. The demand for complex production systems of various purposes, which can flexibly change the content of work, has increased. One of such production systems is FMS (Flexible Manufacturing System). Limited resources must be used in FMS when a number of working procedures are simultaneously being undertaken because the conditions of stand-by job processes cannot be changed. Researchers are currently being conducted to determine ways of preventing deadlocks. In this study, we proposes the algorithm for detection and recovery of a deadlock status using the DDAPN(Deadlock Detection Avoidance Petri Net). Also, we apply the proposed algorithm has a feature to the FMS.

• Journal of Industrial Technology
• /
• v.18
• /
• pp.355-362
• /
• 1998

The deadlock detector is a DBMS sub-component that examines periodically whether system is in a deadlock state based on lock waiting information of transactions. The deadlock detector and transactions execute concurrently in a DBMS and read and/or write the lock waiting information simultaneously. Since the lock waiting information is a shared one, we need an efficient method guaranteeing its physical consistency by using mutual exclusion. In this paper, we propose a new method that effectively guarantees physical consistency of lock waiting information. Two primary goals of our method is to minimize the processing overhead and to maximize system concurrency.