Whittle indexability in egalitarian processor sharing systems
Sign Up to like & getrecommendations! Published in 2017 at "Annals of Operations Research"
DOI: 10.1007/s10479-017-2622-0
Abstract: The egalitarian processor sharing model is viewed as a restless bandit and its Whittle indexability is established. A numerical scheme for computing the Whittle indices is provided, along with supporting numerical experiments. read more here.
Keywords: egalitarian processor; processor sharing; indexability egalitarian; whittle indexability ... See more keywords
PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION
Sign Up to like & getrecommendations! Published in 2017 at "Probability in the Engineering and Informational Sciences"
DOI: 10.1017/s0269964817000092
Abstract: We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers… read more here.
Keywords: customers catastrophes; inert customers; processor sharing; sharing queues ... See more keywords
A FLUID LIMIT FOR PROCESSOR-SHARING QUEUES WEIGHTED BY FUNCTIONS OF REMAINING AMOUNTS OF SERVICE
Sign Up to like & getrecommendations! Published in 2021 at "Probability in the Engineering and Informational Sciences"
DOI: 10.1017/s0269964819000457
Abstract: Abstract We study a single server queue under a processor-sharing type of scheduling policy, where the weights for determining the sharing are given by functions of each job's remaining service (processing) amount, and obtain a… read more here.
Keywords: limit processor; fluid limit; processor sharing; service ... See more keywords