• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.280-289
• /
• 2003

Deadlock recovery-based routing algorithms in wormhole networks have gained attraction due to low hardware complexity and high routing adaptability Progressive deadlock recovery techniques require a few dedicated resources to transmit deadlocked packets rather than killing them. Selection of deadlocked packets is primarily based on time-out value which should be carefully determined considering various traffic patterns or packet length. By its nature, current techniques using time-out accompany unignorable number of false deadlock detections especially in a heavy-loaded network or with long packet size. Moreover, when a deadlock occurs, more than one packet may be marked as deadlocked, which saturate the resources allocated for recovery. This paper proposes more accurate deadlock detection scheme which does not make use of time-out to declare deadlock. The proposed scheme reduces the probability to detect false deadlocks considerably. Furthermore, a single message is selected as deadlocked for each cycle of blocked messages, thereby eliminating recovery overheads.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.26-33
• /
• 2003

The edge-chasing deadlock detection algorithm of Choudhary fails to remove the existing deadlocks after committing the transaction whose priority is lowest on the transaction wait-for path. We proposed a modified algorithm that solves this problem. In this thesis, the performance of the modified algorithm is compared with that of the Tsai's deadlock detection algorithm that uses transaction-resource graph(TR graph) using simulation approach.

• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.53-69
• /
• 1994

Deadlock in flexible manufacturing systems (FMS) which refers to the stop state of job flow in the system can be commonly occurred in operating FMS. This state mainly due to bad movements of jobs and commonly job routings should be avoided to maximize the utilization of high-capital resources in this study, the deadlock generated from the conflict between flow objects competing to occupy space resources in FMS is investigated. Capacity Designated Directed Graph (CDG) is constructed to represent the space resources and flow object routings. From the characteristics of CDG, an algorithm for the detection of the deadlock possibility is proposed. Finally two deadlock avoidance rule are proposed and implemented in the control on Automated Guided Vehicle system in an FMS.

• Journal of Convergence Society for SMB
• /
• v.1 no.1
• /
• pp.75-83
• /
• 2011

Unified Modeling Language (UML) is widely accepted in industry and particularly UML State Machine Diagram is popular for describing the dynamic behavior of classes. This paper discusses deadlock detection of System using UML State Machine Diagram. Since a State Machine Diagram is used for indivisual class' behavior, all the State Machine Diagrams of the classes in the system are combined to make a big system-wide State Machine Diagram to describe system behavior. Generally this system-wide State Machine Diagram is very complex and contains invalid state and transitions. To make it a usable and valid State Machine Diagram, synchronization and externalization are applied. The reduced State Machine Diagram can be used for describing system behavior thus conventional model-checking technique can be applied. This paper shows how deadlock detection of system can be applied with simple examples. All the procedures can be automatically done in the tool.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.34-40
• /
• 2001

This thesis shows that the edge-chasing deadlock detection algorithm of Choudhary fails to remove the existing deadlocks after committing the transaction whose priority is lowest on the transaction wait-fer path. A modified algorithm that solves this problem is proposed.

• 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.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.269-277
• /
• 1998

In most of the distributed deadlock detection algorithms using messages called probes, only a portion of the generated messages are effectively used, and hence the wasted probes cause heavy communication traffic. In this paper, a distributed deadlock detection algorithm is proposed which can efficiently detect deadlocks making use of those residue probes. Our algorithm is complete in the sense that they detect not only those deadlocks in which the initiator is involved as most other algorithms do, but all the other deadlocks that are present anywhere in a connected wait-for-graph. To detect all the deadlocks, the algorithms known to be most efficient require O(ne) messages, where e and n are the number of edges and nodes in the graph, respectively. The single execution of the presented algorithm can accomplish the same task with O(e) messages.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.405-407
• /
• 2007

A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.

• Journal of the Korea Society for Simulation
• /
• v.9 no.1
• /
• pp.67-81
• /
• 2000

In this paper, a new software package for modeling and simulating discrete-event dynamic systems is developed. The new software is a general-purpose, graphical tool based on timed Petri-nets and is developed using Visual Basic and Visual C++ for the window environment. It allows the user to graphically build a Petri-net model and enter input data for executing the Petri-net simulation model. It is equipped with a deadlock detection and recovery function as well as an automatic error check function. In addition, the software supports various enabling functions and distribution functions and provides various statistics for the performance measures of interests pertaining to the system. We expect the new software will be used in a wide number of applications including computer, communication and manufacturing systems.