Static analysis techniques based on session types discern concurrent programs that ensure the fidelity of protocol sessions – for each input (output) end point of a session there is exactly an output (input) end point available – while maintaining a good expressiveness that allows to represent the standard π-calculus and several typing disciplines. More advanced type systems, enforcing stronger...

For finite-buffer manufacturing systems, the major stability issue is ‘deadlock’, rather than ‘bounded-buffer-length stability.’ The paper introduces the concept of ‘system deadlock,’ defined rigorously in Petri net terms, and system operation with uninterrupted part-flow is characterised in terms of the absence of this condition. For a large class of finite-buffer multiclass re-entrant flowlin...

In a previous work, we applied constraint solving techniques to problems like invariant preservation and deadlock freedom checking [2]. The idea behind constraint based deadlock checking is that we set up a logical formula encoding a state where the invariant holds, but all guards are false. We then use the built-in constraint solver to check if the formula has a model. If we can find such a mo...

An important aspect of support for multithreaded MPI executions is the management of communication context identifiers (IDs), which are used to associate MPI communication operations with a communicator. New communicator creation functionality in MPI 3.0 adds complexity to this core resource management problem. We present an efficient algorithm for multithreaded context ID allocation that build...

Model-checking is now widely recognised as an eecient method for analysing computer system properties, such as deadlock-freedom. Its practical applicability is due to existing automatic tools which deal with tedious proofs. Another increasingly research area is formal language integration where the capabilities of each language are used to capture precisely some aspects of a system. In this pap...

We study the problem of priority inversion in distributed real-time and embedded systems and propose a solution based on a distributed version of the priority inheritance protocol (PIP). Previous approaches to priority inversions in distributed systems use variations of the priority ceiling protocol (PCP), originally designed for centralized systems as a modification of PIP that also prevents d...

Any artificial concurrent computing system involves a potential risk of "deadlock" that its multiple processes sharing common computational resources are stuck in starved conditions, if simultaneous accesses of the processes to the resources were unconditionally permitted. To avoid the deadlock, it is necessary to set up some form of central control protocol capable of appropriately regulating ...

In modern multiprocessor systems, interprocessor communication is extremely important. An anti-deadlock strategy is an essential part of a quality communication service. It guarantees that the system can always make forward progress, and it provides the system with tolerance over misbehaving applications. The design of the anti-deadlock strategy has significant impact on the system cost and per...

This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...