ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Sortierung

Digitale Medien

Deadlock free buffer allocation in closed queueing networks (1989)

Kundu, S. ; Akyildiz, I. F.

Springer

Queueing systems 4 (1989), S. 47-56

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9443

Schlagwort(e): Performance evaluation ; queueing networks ; finite buffers ; blocking ; deadlock

Quelle: Springer Online Journal Archives 1860-2000

Thema: Informatik

Notizen: Abstract Blocking queueing networks are of much interest in performance analysis due to their realistic modeling capability. One important feature of such networks is that they may have deadlocks which can occur if the node capacities are not sufficiently large. A necessary and sufficient condition for the node capacities is presented such that the network is deadlock free. An algorithm is given for buffer allocation in blocking queueing networks such that no deadlocks will occur assuming that the network has the special structure called cacti-graph. Additional algorithm which takes linear time in the number of nodes, is presented to find cycles in cacti networks.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1007/BF01150855

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Treffer 1 - 1 | 1 Treffer