In this section, we explain two different reduction techniques to reduce the state space of distributed multithreaded applications. These techniques are exploited in our work. One technique (Section 1) is a slight modification of a reduction technique presented by Godefroid in [1, Section 2]. This reduction technique by Godefroid reduces the state space of a system consisting of a single proces...

Multi-core technology has moved concurrent programming to the forefront of computer science. The C programming language explicitly supports concurrent programming through POSIX threads. Threads execute in parallel and communicate via shared objects that can be locked using synchronized access to achieve mutual exclusion. However, with concurrent programming comes a new set of problems that can ...

This paper presents a modified priority based probe algorithm for deadlock detection and resolution in distributed database systems. The original priority based probe algorithm was presented by Sinha and Natarajan based on work by Chandy, Misra, and Haas. Various examples are used to show that the original priority based algorithm either fails to detect deadlocks or reports deadlocks which do n...

In existing deadlock detection and resolution algorithms, only a few of them can handle deadlocks in generalized request models. Most of these algorithms diffuse probes and collect dependency information in the replies. In this paper, we propose an efficient algorithm to detect and resolve generalized deadlocks. In this algorithm, replies are sent after a process has received all the messages f...

This paper presents a static analysis technique based on effect and behavioural types for deriving synchronisation patterns of stateful active objects and verifying their safety – e.g. absence of deadlocks. This is challenging because active objects use futures to refer to results of pending asynchronous invocations and because these futures can be stored in object fields, passed as method para...

This text introduces the twin deadlocks of strong artificial life. Conceptualization of life is a deadlock both because of the existence of a continuum between the inert and the living, and because we only know one instance of life. Computationalism is a second deadlock since it remains a matter of faith. Nevertheless, artificial life realizations quickly progress and recent constructions embed...

We demonstrate how the use of synchronization primitives and threading policies in object middleware can lead to deadlocks. We identify that object middleware only has a few built-in synchronization and threading primitives and suggest to express them as stereotypes in UML models. We define the semantics of these stereotypes by a mapping to a process algebra. Finally, we apply model checkers to...

This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n − 1 messages and a latency of n ·T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvemen...

In th is paper, we propose a novel deadlock resolut i o n algorithm. In the presence of global deadlocks in a multidatabase sys tem, th i s algorithm always selects a n optimal set of v ic t ims for removing deadlocks. I t makes the use of network f low techniques, and runs in t i m e O(n3) , where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolut...