What people are saying - Write a review
We haven't found any reviews in the usual places.
A MULTIPRIORITY COMPUTER SYSTEM
BOUNDS FOR THE CONTROL NUMBERS
EXACT ANALYSIS A SEMIMARKOV DECISION
2 other sections not shown
accessibility matrix action space Adiri arrival stream arriving user joins bounds are obtained budget constraint busy period Chapter class of users compare the loss computer system Cornell University decision policy defined denoted dissertation expected loss function expected response expected service exponential distribution given class given queue higher priority higher the priority jobs waiting join lower queues join the system left to terminate Lemma lower bounds lower priority queue M/G/l system maximum number MULTI-PRIORITY needed to service newly arriving user number for queue number of users Operations Research optimal joining policy optimal policy Poisson process presented priority job r-class Ross 11 s.Eh scheduling discipline Section 3.5 SEMI-MARKOV DECISION PROCESS service termination stream is shut tagged user tagged user's job upper bound urgency value user joins queue user of class user who joins user will balk user will join users waiting vector waiting in queue WL(i workload