The Experts below are selected from a list of 315 Experts worldwide ranked by ideXlab platform
Mengchu Zhou - One of the best experts on this subject based on the ideXlab platform.
-
Deadlock Resolution in Computer-Integrated Systems
2018Co-Authors: Mengchu Zhou, Maria Pia FantiAbstract:LIST OF CONTRIBUTORS PREFACE INTRODUCTION TO Deadlock RESEARCH IN COMPUTER-INTEGRATED SYSTEMS M.P. Fanti and M.C. Zhou Deadlock AVOIDANCE IN AUTOMATED MANUFACTURING SYSTEMS USING FINITE AUTOMATA AND STATE SPACE SEARCH A. Yalcin, T. Tai, and T.O. Boucher SYNTHESIS OF Deadlock-FREE SUPERVISORY CONTROLLERS USING AUTOMATA A. Ramirez-Serrano and B. Benhabib Deadlock AVOIDANCE AND DYNAMIC ROUTING FLEXIBILITY IN AUTOMATED MANUFACTURING SYSTEMS M. Lawley DIGRAPH-BASED TECHNIQUES FOR Deadlock RESOLUTION IN AUTOMATED MANUFACTURING SYSTEMS M.P. Fanti, B. Maione, G. Maione, and B. Turchiano Deadlock-FREE SUPERVISORY CONTROL FOR ASSEMBLY AND DISASSEMBLY SYSTEMS E. Roszkowska Deadlock AVOIDANCE ALGORITHMS AND IMPLEMENTATION: A MATRIX-BASED APPROACH J. Mireles Jr., F. Lewis, A. Gurel, and S. Bogdan Deadlock DETECTION AND PREVENTION OF AUTOMATED MANUFACTURING SYSTEMS USING PETRI NETS AND SIPHONS M.D. Jeng, and X. Xie SIPHON-BASED CHARACTERIZATION OF LIVENESS AND LIVENESS-ENFORCING SUPERVISION FOR SEQUENTIAL RESOURCE ALLOCATION SYSTEMS S. Reveliotis ELEMENTARY SIPHONS OF PETRI NETS FOR EFFICIENT Deadlock CONTROL Z. Li and M.C. Zhou RESOURCE-ORIENTED PETRI NETS IN Deadlock PREVENTION AND AVOIDANCE N. Wu and M.C. Zhou THE EFFECT OF MODELING AND CONTROL TECHNIQUES ON THE MANAGEMENT OF DeadlockS IN FMS L. Ferrarini and L. Piroddi Deadlock CHARACTERIZATION AND RESOLUTION IN INTERCONNECTION NETWORKS T. M. Pinkston Deadlock MODELS FOR A MULTI-SERVICE MEDIUM ACCESS PROTOCOL EMPLOYING A SLOTTED ALOHA OR Q-ARY TREE BASED SIGNALING CHANNEL M.V. Ivanovich Deadlock-FREE TCP OVER HIGH-SPEED INTERNET R.K.C. Chang, H.Y. Chan and A.W. Yeung Deadlock RESOLUTION IN LARGE-SCALE INTERNET COMPUTING J. Park MODELS USED IN STATIC ANALYSIS FOR DeadlockS OF ADA TASKING PROGRAMS M. Tiusanen and T. Murata Deadlock HANDLING IN DATABASE SYSTEMS M. Weske INDEX
-
Deadlock control of automated manufacturing systems based on petri nets a literature review
Systems Man and Cybernetics, 2012Co-Authors: Zhiwu Li, Naiqi Wu, Mengchu ZhouAbstract:Deadlocks are a rather undesirable situation in a highly automated flexible manufacturing system. Their occurrences often deteriorate the utilization of resources and may lead to catastrophic results in safety-critical systems. Graph theory, automata, and Petri nets are three important mathematical tools to handle Deadlock problems in resource allocation systems. Particularly, Petri nets are considered as a popular formalism because of their inherent characteristics. They received much attention over the past decades to deal with Deadlock problems, leading to a variety of Deadlock-control policies. This study surveys the state-of-the-art Deadlock-control strategies for automated manufacturing systems by reviewing the principles and techniques that are involved in preventing, avoiding, and detecting Deadlocks. The focus is Deadlock prevention due to its large and continuing stream of efforts. A control strategy is evaluated in terms of computational complexity, behavioral permissiveness, and structural complexity of its Deadlock-free supervisor. This study provides readers with a conglomeration of the updated results in this area and facilitates engineers in finding a suitable approach for their industrial scenarios. Future research directions are finally discussed.
-
computationally improved optimal Deadlock control policy for flexible manufacturing systems
Systems Man and Cybernetics, 2012Co-Authors: Yisheng Huang, Mengchu ZhouAbstract:Deadlock prevention, Deadlock detection, and Deadlock avoidance strategies are used to solve the Deadlock problems of flexible manufacturing systems. The theory of regions is recognized as the unique method for obtaining maximally permissive (i.e., optimal) controllers in the existing literature. All legal and live maximal behavior of a Petri net model can be preserved by using a marking/transition-separation instance (MTSI). However, obtaining them is an extremely time consuming problem. This work proposes crucial MTSIs that allow designers to employ much fewer MTSIs to deal with Deadlocks. The advantage of the proposed policy is that an optimal Deadlock controller can be obtained with drastically reduced computation. Experimental results, by varying the markings of given net structures, indicate that it is the most efficient policy to obtain such controllers.
-
on siphon computation for Deadlock control in a class of petri nets
Systems Man and Cybernetics, 2008Co-Authors: Mengchu ZhouAbstract:As a structural object, siphons are well recognized in the analysis and control of Deadlocks in resource allocation systems modeled with Petri nets. Many Deadlock prevention policies characterize the Deadlock behavior of the systems in terms of siphons and utilize this characterization to avoid Deadlocks. This paper develops a novel methodology to find interesting siphons for Deadlock control purposes in a class of Petri nets, i.e., a system of simple sequential processes with resources . Resource circuits in an are first detected, from which, in general, a small portion of emptiable minimal siphons can be derived. The remaining emptiable ones can be found by their composition. A polynomial-time algorithm for finding the set of elementary siphons is proposed, which avoids complete siphon enumeration. It is shown that a dependent siphon can always be controlled by properly supervising its elementary siphons. A computationally efficient Deadlock control policy is accordingly developed. Experimental study shows the efficiency of the proposed siphon computation approach.
T M Pinkston - One of the best experts on this subject based on the ideXlab platform.
-
a progressive approach to handling message dependent Deadlock in parallel computer systems
IEEE Transactions on Parallel and Distributed Systems, 2003Co-Authors: Yong Ho Song, T M PinkstonAbstract:Handling Deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems. The existence of multiple message types and associated inter-message dependencies may cause message-dependent Deadlocks in networks that are designed to be free of routing Deadlock. Most methods currently used for dealing with message-dependent Deadlocks require more system resources than are necessary and/or do not use system resources efficiently. This may have an adverse effect on system performance if resources are scarce. In this paper, we characterize the frequency of message-dependent Deadlocks in multiprocessor/multicomputer systems. We also propose a handling technique for message-dependent Deadlocks based on progressive Deadlock recovery and evaluate its performance with other approaches. Results show that message-dependent Deadlocks occur very infrequently under typical circumstances thus, rendering approaches based on avoiding them overly restrictive in the common case. The proposed technique relaxes restrictions considerably, allowing the routing of packets and the handling of message-dependent Deadlocks to be much more efficient-particularly when network resources are scarce.
-
an efficient fully adaptive Deadlock recovery scheme disha
International Symposium on Computer Architecture, 1995Co-Authors: K V Anjan, T M PinkstonAbstract:This paper presents a simple, efficient and cost effective routing strategy that considers Deadlock recovery as opposed to prevention. Performance is optimized in the absence of Deadlocks by allowing maximum flexibility in routing. Disha supports true fully adaptive routing where all virtual channels at each node are available to packets without regard for Deadlocks. Deadlock cycles, upon forming, are efficiently broken by progressively routing one of the blocked packets through a Deadlock-free lane. This lane is implemented using a central "floating" Deadlock buffer resource in routers which is accessible to all neighboring routers along the path. Simulations show that the Disha scheme results in superior performance and is extremely simple, ensuring quick recovery from Deadlocks and enabling the design of fast routers.
-
disha a Deadlock recovery scheme for fully adaptive routing
International Parallel Processing Symposium, 1995Co-Authors: K V Anjan, T M PinkstonAbstract:This paper presents a simple method of implementing an efficient and cost effective routing scheme. The strategy considers Deadlock recovery as opposed to prevention to optimize performance in the absence of Deadlocks. Cycles are broken by re-routing a blocked packet through a Deadlock-free lane which is implemented as a central "floating" buffer. The proposed scheme is extremely simple, ensuring quick recovery from Deadlocks and enabling the design of fast routers. >
Jose Duato - One of the best experts on this subject based on the ideXlab platform.
-
fc3d flow control based distributed Deadlock detection mechanism for true fully adaptive routing in wormhole networks
IEEE Transactions on Parallel and Distributed Systems, 2003Co-Authors: J M M Rubio, P Lopez, Jose DuatoAbstract:Two general approaches have been proposed for Deadlock handling in wormhole networks. Traditionally, Deadlock-avoidance strategies have been used. In this case, either routing is restricted so that there are no cyclic dependencies between channels or cyclic dependencies between channels are allowed provided that there are some escape paths to avoid Deadlock. More recently, Deadlock recovery strategies have begun to gain acceptance. These strategies allow the use of unrestricted fully adaptive routing, usually outperforming Deadlock avoidance techniques. However, they require a Deadlock detection mechanism and a Deadlock recovery mechanism that is able to recover from Deadlocks faster than they occur. In particular, progressive Deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver Deadlocked messages, instead of killing them. Unfortunately, distributed Deadlock detection is usually based on crude time-outs, which detect many false Deadlocks. As a consequence, messages detected as Deadlocked may saturate the bandwidth offered by recovery resources, thus degrading performance. Additionally, the threshold required by the detection mechanism (the time-out) strongly depends on network load, which is not known in advance at the design stage. This limits the applicability of Deadlock recovery on actual networks. We propose a novel distributed Deadlock detection mechanism that uses only local information, detects all the Deadlocks, considerably reduces the probability of false Deadlock detection over previously proposed techniques, and is not significantly affected by variations in message length and/or message destination distribution.
-
on the reduction of Deadlock frequency by limiting message injection in wormhole networks
Lecture Notes in Computer Science, 1998Co-Authors: P Lopez, Jose Duato, J M Martinez, Fabrizio PetriniAbstract:Recently, Deadlock recovery strategies began to gain acceptance in networks using wormhole switching. In particular, progressive Deadlock recovery techniques are very attractive because they allocate a few dedicated resources to quickly deliver Deadlocked packets, instead of killing them. Deadlock recovery is based on the assumption that Deadlocks are really rare. Otherwise, recovery techniques are not efficient. In this paper, we propose the use of a message injection limitation mechanism that reduces the probability of Deadlock to negligible values, even when fully adaptive routing is used. The main new feature is that it can be used with different message destination distributions. The proposed mechanism can be combined with any Deadlock detection mechanism. In particular, we use the Deadlock detection mechanism proposed in [21]. In addition, the proposed injection limitation mechanism considerably reduces performance degradation when the network reaches the saturation point.
-
software based Deadlock recovery technique for true fully adaptive routing in wormhole networks
International Conference on Parallel Processing, 1997Co-Authors: J M Martinez, P Lopez, Jose Duato, Timothy Mark PinkstonAbstract:In this paper, we take a different approach to handle Deadlocks and performance degradation. We propose the use of an injection limitation mechanism that prevents performance degradation near the saturation point and reduces the probability of Deadlock to negligible values even when fully adaptive routing is used. We also propose an improved Deadlock detection mechanism that only uses local information, detects all the Deadlocks, and considerably reduces the probability of false Deadlock detection over previous proposals. In the rare case when impending Deadlock is detected, our proposed recovery technique absorbs the Deadlocked message at the current node and later re-injects it for continued routing towards its destination. Performance evaluation results show that our new approach to Deadlock handling is more efficient than previously proposed techniques.
Richard A Wysk - One of the best experts on this subject based on the ideXlab platform.
-
graph theoretic Deadlock detection and resolution for flexible manufacturing systems
International Conference on Robotics and Automation, 1995Co-Authors: Hyuenbo Cho, T K Kumaran, Richard A WyskAbstract:Flexible manufacturing systems are capable of producing a broad variety of products and changing their characteristics quickly and frequently. This flexibility provides for more efficient use of resources, but makes control of these systems more difficult. Control problems previously unstudied now require practical resolution, like system Deadlock. A system Deadlock is a situation that arises due to resource sharing in manufacturing systems, when the flow of parts is permanently inhibited and/or operations on parts cannot be performed. This problem has been ignored by most scheduling and control studies, which usually assume infinite machine queue capacity and unlimited tooling resources. FMS's, however, have little or no queue capacity and limited tooling resources. In this paper, graph-theoretic Deadlock detection and resolution procedures are presented which are suitable for real-time control of manufacturing systems. These procedures determine whether part movement in the system causes system Deadlock or not. To this end, a system status graph representing part routings is virtually updated for every part movement before parts move physically to the next destination. Two types of system Deadlocks, part flow Deadlock and impending part flow Deadlock, are detected using the updated system status graph. If a Deadlock detection and recovery method is used to recover from a Deadlock using a storage buffer, only part flow Deadlocks need to be detected. On the other hand, if no buffer is available, both types of existing as well as impending system Deadlocks need to be detected to avoid a Deadlock situation. >
-
a structured approach to Deadlock detection avoidance and resolution in flexible manufacturing systems
International Journal of Production Research, 1994Co-Authors: T K Kumaran, W Chang, Hyunbo Cho, Richard A WyskAbstract:Abstract Production scheduling models that determine part mix ratios and detailed schedules do not usually account for Deadlocks that can be caused by part flow. Deadlocks must be prevented for operational control (especially in automated systems). The major thrust of this paper is in developing a structured model for Deadlock detection, avoidance and resolution caused by part flow in manufacturing systems. A system status graph can be constructed for the parts currently in the system. Deadlock detection amounts to determining Deadlocks in the system status graph. On the other hand, Deadlock avoidance amounts to restricting parts movement so that Deadlocks are completely avoided in the future. While Deadlock detection is a one-step look ahead procedure, Deadlock avoidance is a complete look ahead procedure. Deadlock resolution or recovery amounts to judiciously using a limited queue to recover from Deadlocks. Deadlock detection and avoidance are absolutely crucial to uninterrupted operation of automated m...
-
Detection of Deadlocks in flexible manufacturing cells
IEEE Transactions on Robotics and Automation, 1991Co-Authors: Richard A Wysk, N.s. Yang, Sanjay JoshiAbstract:One specific problem of control, namely, system Deadlock that can arise in an unmanned flexible manufacturing system (FMS) is addressed, and some related work in the Deadlocking of computer systems is described. A formal model for manufacturing system Deadlock detection is presented. Necessary and sufficient conditions for manufacturing system Deadlock based on actual manufacturing-system characteristics are defined along with a set of bounds for searching for Deadlocks. An implementation approach is also presented. >
Timothy Mark Pinkston - One of the best experts on this subject based on the ideXlab platform.
-
software based Deadlock recovery technique for true fully adaptive routing in wormhole networks
International Conference on Parallel Processing, 1997Co-Authors: J M Martinez, P Lopez, Jose Duato, Timothy Mark PinkstonAbstract:In this paper, we take a different approach to handle Deadlocks and performance degradation. We propose the use of an injection limitation mechanism that prevents performance degradation near the saturation point and reduces the probability of Deadlock to negligible values even when fully adaptive routing is used. We also propose an improved Deadlock detection mechanism that only uses local information, detects all the Deadlocks, and considerably reduces the probability of false Deadlock detection over previous proposals. In the rare case when impending Deadlock is detected, our proposed recovery technique absorbs the Deadlocked message at the current node and later re-injects it for continued routing towards its destination. Performance evaluation results show that our new approach to Deadlock handling is more efficient than previously proposed techniques.
-
ISCA - On Deadlocks in interconnection networks
Proceedings of the 24th annual international symposium on Computer architecture - ISCA '97, 1997Co-Authors: Timothy Mark Pinkston, S. WarnakulasuriyaAbstract:Deadlock avoidance-based and Deadlock recovery-based routing algorithms have been proposed in recent years without full understanding of the likelihood and characteristics of actual Deadlocks in interconnection networks. This work models the interrelationships between routing freedom, message blocking, correlated resource dependencies and Deadlock formation. We empirically show that increasing routing freedom, as achieved by allowing unrestricted routing over multiple virtual channels, makes Deadlocks highly improbable and reduces the likelihood of other types of correlated message blocking behavior that can degrade performance. Our results further substantiate that recovery-based routing algorithms have a higher potential performance advantage over Deadlock avoidance-based routing algorithms which, inherently, allow less routing freedom.
-
IPPS - Characterization of Deadlocks in interconnection networks
Proceedings 11th International Parallel Processing Symposium, 1Co-Authors: S. Warnakulasuriya, Timothy Mark PinkstonAbstract:Deadlock-free routing algorithms have been developed recently without fully understanding the frequency and characteristics of Deadlocks. Using a simulator capable of true Deadlock detection, we measure a network's susceptibility to Deadlock due to various design parameters. The effects of bidirectionality, routing adaptivity, virtual channels, buffer size and node degree on Deadlock formation are studied. In the process, we provide insight into the frequency and characteristics of Deadlocks and the relationship between routing flexibility blocked messages, resource dependencies and the degree of correlation needed to form Deadlock.
