General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines.
Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models (QN...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
University of Bradford
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10454/4214 |