TIME SHARING WITH AN EXPLICIT PRIORITY QUEUING DISCIPLINE.
MASSACHUSETTS INST OF TECH CAMBRIDGE OPERATIONS RESEARCH CENTER
Pagination or Media Count:
The thesis is a mathematical analysis of a round-robin computer time sharing system which is characterized by homogeneous Poisson arrivals, exponentially distributed service times and an ordered priority queue. Each new arrival buys a position in this queue by offering a non-negative bribe to the manager of the computer facility. The system is modelled as a continuous time stochastic process and is analyzed by the method of imbedded Markov chains. Relevant queuing statistics are identified and derived in terms of system parameters. The sensitivity of these results to changes in key system parameters is investigated through numerical examples. Finally, to maximize the expected revenue per unit time accruing from bribes, an optimization problem is formulated and solved with two of the system parameters as decision variables. Author
- Computer Systems