The Mean Value Analysis (MVA) algorithm is one of the most popular for evaluating the performance of separable (or product form) queueing networks. Although its complexity is modest when jobs are indistinguishable, the introduction of different customer classes rapidly increases its computational cost. The problems of parallelising the algorithm while retaining its conceptual simplicity are examined. In particular, a parallel implementation of MVA on a distributed memory machine is developed using the MPI library for communication.
Parallelising the Mean Value Analysis algorithm
Gennaro C;
1999
Abstract
The Mean Value Analysis (MVA) algorithm is one of the most popular for evaluating the performance of separable (or product form) queueing networks. Although its complexity is modest when jobs are indistinguishable, the introduction of different customer classes rapidly increases its computational cost. The problems of parallelising the algorithm while retaining its conceptual simplicity are examined. In particular, a parallel implementation of MVA on a distributed memory machine is developed using the MPI library for communication.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_239819-doc_61732.pdf
solo utenti autorizzati
Descrizione: Parallelising the Mean Value Analysis algorithm
Tipologia:
Versione Editoriale (PDF)
Dimensione
107 kB
Formato
Adobe PDF
|
107 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
