Deadlock Avoidance

... Add to: Digg Furl. Spurl Blink. Simpy Google. Del.icio.us Y!MyWeb. Search, Similar Articles; Articles by Rajni Ranjan Singh; Articles by Dileep Kumar Singh. 2010 International Conference on Computational Intelligence and Communication ...

Operating system is a set of programs that control the execution of application programs and act as an intermediary between a user of a computer and the computer hardware. Process is a program in execution. It is the unit of work in most system. Process state is the current activity of that process. The PCB is a data structure. It use as the repository for any information that may vary from process to process. Each process has its PCB. The dispatcher is the module that gives control of the CPU to the process selected by the short-term scheduler.

Deadlock-avoidance mechanisms in distributed systems. AK Datta, S Ghosh, D Harms, AK Elmagarmid COMP. SYST. SCI. ENG. 3:22, 67-82, 1988. There are instances in real-time applications where several distributed processes compete for access to a shared resource. ...

Abstract The intensive and continuous use of high-performance computing systems for executing computationally intensive applications, coupled with the large number of elements that make them up, dramatically increase the likelihood of failures during their operation. Clearly, network faults have an extremely high impact because most routing algorithms are not designed to tolerate faults. In such algorithms, just a single fault may lead to deadlocked configurations thus preventing the correct finalization of applications. This paper ...

Abstract: Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous burdens on developers, entail high runtime performance overheads, or offer no help for unmodified legacy code. Gadara automates dynamic deadlock avoidance for conventional multithreaded programs. It employs whole-program static analysis to model programs, and Discrete Control Theory to synthesize lightweight, decentralized, highly ...

Most commercial routers designed for networks of workstations (NOWs) implement wormhole switching. However wormhole switching is not well suited for NOWs. The long wires required in this environment lead to large buffers to prevent buffer overflow during flow control signaling. Moreover, wire length is limited by buffer size. Virtual cut-through (VCT) achieves a higher throughput than wormhole switching. Moreover, the traditional disadvantages of VCT switching, as buffer requirements and packetizing overhead, disappear in NOWs. In this paper, we show that VCT routers can be simpler than wormhole ones, while still achieving the advantages of using virtual channels and adaptive routing. We also propose a fully adaptive routing algorithm for VCT switching in NOWs. Moreover, we show that VCT routers outperform wormhole routers in a NOW environment at a lower cost

InfiniBand is an interconnect standard for communica- tion between processing nodes and I/O devices as well as for interprocessor communication (NOWs). The Infini- Band Architecture (IBA) defines a switch-based network with point-to-point links whose topology can be established by the customer. When the performance is the primary con- cern regular topologies are preferred. Low-dimensional tori (2D and 3D) are some

ABSTRACT Most of the past research on the problem of deadlock avoidance for complex resource allocation systems (RAS) has acknowledged the fact that the computation of the maximally permissive deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and therefore, it has resorted to solutions that trade off maximal permissiveness for computational tractability. In this paper, we distinguish between the off-line and the on-line computation that is required for the effective implementation of the maximally permissive DAP, and we seek to develop representations of this policy that will require minimal on-line computation. The particular representation that we adopt is that of a compact classifier that will effect the underlying dichotomy of the reachable state space into safe and unsafe subspaces. Furthermore, in this first study of the aforementioned problem, we restrict our attention to a particular RAS class that is motivated by an ongoing project of ours called Gadara, and accepts separation of the safe and unsafe subspaces of its instantiations through a set of linear inequalities. Through a series of reductions of the derived classification problem, we are also able to attain extensive reductions in the computational complexity of the off-line task of the construction of the sought classifier. We formally establish completeness and optimality properties for the proposed design procedures. We also offer heuristics that, if necessary, can alleviate the computational effort that is necessary for the construction of the sought classifier. Finally, we demonstrate the efficacy of the developed approaches through a series of computational experiments. To the best of our knowledge, these experiments also establish the ability of the proposed methodology to effectively compute tractable implementations of the maximally permissive DAP for problem instances significantly beyond the capacity of any other approach currently available in the literatur- - e.

Abstract The interconnection network communicates and links together the processing units of modern high-performance computing systems. In this context, network faults have an extremely high impact since most routing algorithms were not designed to tolerate faults. Because of this, just a single fault may stall messages in the network, preventing the finalization of applications, or may lead to deadlocked configurations. In this paper we introduce a scalable deadlock avoidance technique specifically designed to deal with ...

This paper addresses the problem of designing a control scheme capable of avoiding deadlock conditions for a class of manufacturing systems. The considered model for the system under control is based on Petri nets, and is formulated according to well-known modelling rules. A deadlock avoidance policy is proposed which is an extension of a previously presented one. The proofs of its main properties are briefly sketched. Finally, an example of an automated manufacturing system for which such a deadlock avoidance policy has been applied is discussed.

This paper proposes a data race prevention scheme, which can eliminate data races in the View-Oriented Parallel Programming (VOPP) model. VOPP is a novel shared- memory data-centric parallel programming model, which uses views to bundle mutual exclusion with data access. We have implemented the data race prevention scheme with a memory protection mechanism. Experimental re- sults show that the extra

Deadlock avoidance is a key issue in wormhole networks. A first approach [9] consists in removing the cyclic dependencies between channels. Although the absence of cyclic dependencies is a necessary and sufficient condition for deadlock-free deterministic routing, it is only a sufficient condition for deadlock-free adaptive routing. A more powerful approach [12] only requires the absence of cyclic dependencies on a connected channel subset. Moreover, we proposed a necessary and sufficient condition for deadlock-free adaptive routing [15]. In this paper, we design adaptive routing algorithms for k-ary n-cubes. In particular, we propose partially adaptive and fully adaptive routing algorithms which considerably increase the throughput achieved by the deterministic routing algorithm. Also, we evaluate the performance of the new routing algorithms under both, uniform and non-uniform distribution of message destinations.