Department of Electrical Engineering Doctor of Engineering A Selective Packet Discard Technique for Efficient Deadlock Recovery in Networks-on-Chip by Andreas Johann Lankes The ever increasing complexity of Systems-on-Chip (SoCs) and the hereby also increasing communication requirements lead to the necessity of new on-chip communication concepts. The concept of NoCs was introduced to provide sc...

Model petri net dari sistem antrian di loket pendaftaran pasian pada suatu rumah sakit Kota Kupang telah dikonstruksi. Analisis coverability tree tersebut perlu dilakukan untuk melihat apakah yang dibangun sesuai dengan kenyataan dan dapat terus berlangsung (liveness) atau terjadi deadlocks. Adapun langkah-langkah penelitian ini dimulai melakukan studi literatur terkait analisis pengamatan alur...

A deadlock is a situation where a process or a set of processes is blocked, waiting on an event that will never occur. In this case of a deadlock, the intervention of a process outside of those involved in the deadlock is required to recover from the deadlock. The formation and existence of deadlocks in a system lowers system efficiency. Therefore, avoiding performance degradation due to deadlo...

In this paper we address the deadlock detection problem in the context of SCOOP an OOprogramming model for concurrency, recently formalized in Maude. We present the integration of a deadlock detection mechanism on top of the aforementioned formalization and analyze how an abstract semantics of SCOOP based on a notion of may alias expressions can contribute to improving the deadlock detection pr...

When multiple agents solve their own problems while they interact with each other, it is helpful to form a coalition, which is a group of agents working together. Previous approaches to coalition formation have proposed to de ne the utility of coalitions and to use a strategy that agents form coalitions for getting higher utility. However, in some problems, the utility of coalitions is not easi...

Tasking deadlock is one of the most serious and complex problems concerning the reliability of concurrent systems with Ada. In this paper, tasking deadlocks which may occur in Ada 95 programs are investigated, a representation, named the Task-Wait-For Graph, for task synchronization waiting state of an Ada 95 program is proposed, and a runtime detection method for the tasking deadlocks based on...

In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of victims for removing deadlocks. It makes the use of network ow techniques, and runs in time O(n 3), where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorithm dose...