Name
Title | ||
|---|---|---|
Sojourn-time approximations for a multi-server processor sharing system with priorities |
Abstract | ||
|---|---|---|
We study mean sojourn times in a multi-server processor sharing system with two priority classes and with general service-time distributions. For high-priority customers, the mean sojourn time follows directly from classical results on symmetric queues. For low-priority customers, in the absence of exact results, we propose a simple and explicit approximation for the mean sojourn time. Extensive numerical experiments demonstrate that the approximations are highly accurate for a wide range of parameter settings. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0166-5316(03)00094-4 | Perform. Eval. |
Keywords | Field | DocType |
extensive numerical experiment,sojourn-time approximations,parameter setting,mean sojourn time,exact result,low-priority customer,process sharing system,high-priority customer,explicit approximation,symmetric queues,multi-server processor sharing system,priorities,classical result,general service-time distribution,sojourn-time approximation,mathematical models,servers,informatics,approximation theory,queueing theory | Mean sojourn time,Multi server,Computer science,Parallel computing,Queue,Server,Approximation theory,Processor sharing,Real-time computing,Queueing theory,Mathematical model,Distributed computing | Journal |
Volume | Issue | ISSN |
54 | 3 | Performance Evaluation |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. D. Van der Mei | 1 | 14 | 2.37 |
| J. L. van der Berg | 2 | 0 | 0.34 |
| R. Vranken | 3 | 0 | 0.34 |
| B. M. M. Gijsen | 4 | 18 | 2.61 |