This work concentrates on deadlock problems in concurrent systems due to the common use of system resources organized in what is commonly known as Sequential Resource Allocation Systems and paying a special attention to subclasses of manufacturing systems. To do that, special classes of Petri net models are defined that allow to capture resource allocation events used to synchronize processes t...

Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present a new selection policy that can be coupled to any adaptive routing algorithm to improve the performance in terms of average delay. The proposed approach introduce the concept of Neighbors-on-Path to exploit the situations of indecision occurring when the routing function returns seve...

This article proposes a semi-structural approach to verify the nonblockingness of Petri net. We construct structure, called minimal-maximal basis reachability graph (min-max-BRG): it provides an abstract description set net while preserving all information needed test if is xmlns:xlink="http://...

We present an adaptive deadlock-free routing algorithm which decomposes a given network into two virtual interconnection networks, V IN 1 and V IN 2. V IN 1 supports deterministic deadlock-free routing, and V IN 2 supports fully-adaptive routing. Whenever a channel in V IN 1 or V IN 2 is available, it can be used to route a message. Each node is identiied to be in one of three states: safe, uns...

Weighted Petri nets are common tools for modeling and validating discrete event systems involving resource allocation, such as flexible manufacturing (FMSs). A subclass of weighted called a system sequential with shared resources (S 4 R) has the power complex FMSs where execution an operation ma...

A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems associated with conventional locking techniques, including priority inversion, convoying, and difficu...

High performance, freedom from deadlocks, and freedom from livelocks are desirable properties of interconnection networks. Unfortunately, these can be conflicting goals because networks may either devote or under-utilize resources to avoid deadlocks and livelocks. These resources could otherwise be used to improve performance. For example, a minimal adaptive routing algorithm may forgo some rou...

Two way buffer system is a system that exhibits transfer of data using two buffers concurrently. It includes processes that synchronize to exchange data with each other along with executing certain delays between these synchronizations. In existing Tiny Two Way Buffer System, both generators produce packets in half duplex manner in no time, deterministic time, and non deterministic time. Analys...

Abst rac t : We present deadlock-free packet (wormhole) routing algorithms based on multi-dimensional interval schemes for cert~n multiprocessor interconnection networks and give their analysis in terms of the compactness and the size (the maximum number of buffers per node (per link)). The issue of a simultaneous reduction of the compactness and the size is fundamental, worth to investigate an...