Petri nets have been recognized as a powerful, graphical, and mathematical tool and widely used to model flexible manufacturing systems (FMS). To solve the problem of deadlock prevention for timed Petri nets (TdPN), an effective deadlock prevention policy based on the transition priority is presented in this poster. By analyzing reachability graphs of TdPN, a new class of TdPN named TdS 3 PRC i...

A deadlock-free multicast scheme called prefix multicasting in irregular networks is studied. In prefix routing, a compact routing table is associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular networ...

as technology scales deep into the nanometer regime, on-chip communication becomes more susceptible to transient noise sources, such as crosstalk, external radiation, and spurious voltage spikes. the network on chip s modularity and reusability has brought about the use of error control methods to address transient errors in network on chip links.in this work, we design a fault tolerance router...

In this paper, we consider TCP throughput deadlock problems caused by an interplay between the Nagle algorithm, delayed acknowledgment algorithm, and several implementation details. For some combinations of send and receive buffers, a TCP sender cannot send more segments due to the Nagle algorithm and, at the same time, a TCP receiver cannot acknowledge more segments received due to the delayed...

Very recently, it was shown that the well known scoreboard as introduced in the CDC 6600 and described in current textbooks runs into deadlocks. However, it is one of the two major scheduling mechanisms used in todays microprocessors. This paper presents a corrected version of the scoreboard and formally proves that mechanism to be correct and deadlock free.

We extend Kobayashi and Sumii's type system for the deadlock-free -calculus and develop a type reconstruction algorithm. Kobayashi and Sumii's type system helps high-level reasoning about concurrent programs by guaranteeing that communication on certain channels will eventually succeed. It can ensure, for example, that a process implementing a function really behaves like a function. However, b...

InfiniBand Architecture (IBA) is a newly established general-purpose interconnect standard applicable to local area, system area and storage area networking and I/O. Networks based on this standard should be capable of tolerating topological changes due to resource failures, link/switch activations, and/or hot swapping of components. In order to maintain connectivity, the network’s routing func...

| This paper focuses on eecient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model signiicantly generalizes the path-based model proposed earlier 21], 22], which works only for Hamiltonian networks...

In this paper we propose a deadlock free routing in irregular networks using pre x routing Pre x routing is a special type of routing with a compact routing table associated with each node processor Basically each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node Node and channel labeling in an...

In this paper, a new kind of deadlock-free scheduling method based on genetic algorithm and reachability analysis of timed SPR nets is proposed to solve the scheduling problems of job shop without buffers. Under the framework of timed Petri nets model, the scheduling problem can be described as finding a feasible transition firing sequence in the Petri nets model to avoid deadlock situations an...