Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
A single-server queueing system with N priority classes, general service times, and preemptive resume discipline is investigated. The first two moments of the waiting time are calculated. The mathematical method uses the approximation of the waiting time by lower and upper bounds which converge to one another. These bounds are the solution of certain time-discrete queueing models. © 1980 Springer-Verlag.
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering