Abstract
Optimal schedules in a central server model, consisting of a `CPU' server and m `I/O' servers, are obtained for the case of two customers. Each customer has exponential service time distributions with a distinct mean at the CPU server and with the same mean at any I/O servers. The performance measure considered is an arbitrarily weighted sum of the CPU utilization for each customer. It is shown that the optimal CPU and I/O schedules are either one of preemptive priority disciplines depending on certain conditions; the conditions are also obtained. A proof is given to the conjecture made by Spirn on the model and the results of Spirn's are generalized.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
