Casale, Giuliano and Tribastone, Mirco Process-algebraic modelling of priority queueing networks. In: 9th Workshop on Process Algebra and Stochastically Timed Activities (PASTA), September 2010, London, UK pp. 1-6. (Unpublished) (2010)
|
PDF
- Submitted Version
Available under License Creative Commons Attribution No Derivatives. Download (130kB) | Preview |
Abstract
We consider a closed multiclass queueing network model in which each class receives a different priority level and jobs with lower priority are served only if there are no higher-priority jobs in the queue. Such systems do not enjoy a product form solution, thus their analysis is typically carried out through approximate mean value analysis (AMVA) techniques. We formalise the problem in PEPA in a way amenable to differential analysis. Experimental results show that our approach is competitive with simulation and AMVA methods.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 06 Feb 2015 11:16 |
| Last Modified: | 06 Feb 2015 11:16 |
| URI: | http://eprints.imtlucca.it/id/eprint/2557 |
Actions (login required)
 |
Edit Item |
