Deadlock properties of queueing networks with finite capacities and multiple routing chains

@article{Liebeherr1995DeadlockPO,
  title={Deadlock properties of queueing networks with finite capacities and multiple routing chains},
  author={J{\"o}rg Liebeherr and Ian F. Akyildiz},
  journal={Queueing Systems},
  year={1995},
  volume={20},
  pages={409-431}
}
Blocking in queueing network models with finite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and sufficient conditions for deadlockfree queueing networks with blocking are provided. An optimization algorithm is presented for finding deadlock-free capacity assignments with the least total capacity. The optimization algorithm maps the queueing network into a directed graph and… 
Modelling deadlock in open restricted queueing networks
Deadlock-free buffer configuration for stream computing
TLDR
It is shown that bad configuration of output buffers can lead to application deadlock, and an efficient method based on all-pair shortest path algorithms to detect unsafe buffer configurations is proposed.
Modelling deadlock in queueing systems
TLDR
A graph theoretical method of detecting deadlock in discrete event simulations is given, analytical models of deadlocking systems are built, and these are used to investigate the effect of system parameters on the expected time until reaching deadlock.
Deadlock-free buffer configuration for stream computing
TLDR
This article describes three types of deadlock in streaming applications, categorized by how they can be created, and proposes both compile-time and runtime solutions for deadlock avoidance.

References

SHOWING 1-10 OF 13 REFERENCES
Deadlock free buffer allocation in closed queueing networks
TLDR
A necessary and sufficient condition for the node capacities is presented such that the network is deadlock free and an algorithm is given for buffer allocation in blocking queueing networks such that no deadlocks will occur assuming that thenetwork has the special structure called cacti-graph.
Survey of closed queueing networks with blocking
TLDR
This paper gives a systematic presentation of the literature related to closed queueing networks with finite queues and the results are significant for both researchers and practitioners.
Finding All the Elementary Circuits of a Directed Graph
An algorithm is presented which finds all the elementary circuits of a directed graph in time bounded by $O((n + e)(c + 1))$ and space bounded by $O(n + e)$, where there are n vertices, e edges and c
Deadlock Free Bu er Allocation in Closed Queueing Networks
  • Queueing Systems,
  • 1989
Linear, Integer, and Quadratic Programming with Lindo
A Bibliography of Papers on Queueing Networks with Finite Capacity Queues
Deadlock-Free Bu er Allocations in Blocking Networks with Tandem Sequences
  • Proc. 2nd Workshop on Queueing Networks with Finite Capacities,
  • 1993
Deadlock Free Buuer Allocation in Closed Queueing Networks
  • Queueing Systems
  • 1989
Performance Evaluation of Synchronized Systems
  • PhD thesis, Georgia Institute of Technology, College of Computing,
  • 1991
Queueing Networks with Finite Capacity Queues. Special Issue of Performance Evaluation
  • Queueing Networks with Finite Capacity Queues. Special Issue of Performance Evaluation
  • 1989
...
...