In this paper, we introduce a new product-form queueing network model where servers are always busy. This is obtained by defining a job movement policy that admits instantaneous migrations of jobs from non-empty waiting buffers to empty ones. Thus, the resulting routing scheme is statedependent. This class of networks tends to maximize the system throughput and can be used to model situations where successive refinements on jobs improve the processes quality but are not strictly required to obtain a result.
A product-form network for systems with job stealing policies
Marin A.;Rossi S.;Olliaro D.
2023-01-01
Abstract
In this paper, we introduce a new product-form queueing network model where servers are always busy. This is obtained by defining a job movement policy that admits instantaneous migrations of jobs from non-empty waiting buffers to empty ones. Thus, the resulting routing scheme is statedependent. This class of networks tends to maximize the system throughput and can be used to model situations where successive refinements on jobs improve the processes quality but are not strictly required to obtain a result.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.