Aim of this paper is to study the complexity of the Deadlock-Safety problem for Store-and-Forward networks. The following results are shown: 1. the problem is in general NP-complete, even for tree-like networks. It is still NP-complete for various "simple" topologies (including bipartite, grid and two-terminals series-parallel graphs) when each vertex buffer is of unit capacity; 2. the problem is solvable in PTIME for 1-buffer tree-like networks.

Predicting deadlock in store-and-forward networks

ARBIB, CLAUDIO;
1988-01-01

Abstract

Aim of this paper is to study the complexity of the Deadlock-Safety problem for Store-and-Forward networks. The following results are shown: 1. the problem is in general NP-complete, even for tree-like networks. It is still NP-complete for various "simple" topologies (including bipartite, grid and two-terminals series-parallel graphs) when each vertex buffer is of unit capacity; 2. the problem is solvable in PTIME for 1-buffer tree-like networks.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/34887
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact