Abstract
A means of specifying priority specific dispatching is provided so that FIFO is not the only 'within_priorities' scheme supported. A Round_Robin_Within_Priorities dispatching policy is defined.
Index Terms
Ada Issue 00355: priority specific dispatching including round robin
Recommendations
On Round-Robin routing with FCFS and LCFS scheduling
We study the Round-Robin (RR) routing to a system of parallel queues, which serve jobs according to FCFS or preemptive LCFS scheduling disciplines. The cost structure comprises two components: a service fee and a queueing delay related component. With ...
Round-robin routing policy: value functions and mean performance with job- and server-specific costs
ValueTools '13: Proceedings of the 7th International Conference on Performance Evaluation Methodologies and ToolsWe study the Round-Robin (RR) routing to a system of parallel queues. The cost structure comprises two components: a service fee and a queueing delay related component, where both can be job- and queue-specific random variables. With Poisson arrivals, ...
Asymptotic optimality of the Round---Robin policy in multipath routing with resequencing
We consider a model of a multipath routing system where arriving customers are routed to a set of identical, parallel, single server queues according to balancing policies operating without state information. After completion of service, customers are ...






Comments