Abstract

In this paper, we consider a stochastic queueing model for the performance evaluaton of a real-life computer system consisting of n terminals connected with a CPU. A user at terminal i has thinking and processing time depending on the index i. Let us suppose that the operational system is subject to random breakdowns, which may be software or hardware ones, stopping the service both at the terminals and at the CPU. The failure-free operation times of the system and the restoration times are random variables. Busy terminals are also subject to random breakdowns not affecting the system operation. The failure-free operation times and the repair times of a busy terminal i are random variables with distribution function depending on index i. The breakdowns are serviced by a single repairman providing preemptive priority to the system's failure, while the restoration at the terminals are carried out according to the FIFO rule. We assume that each user generates only one job at a time, and he waits at the CPU before he starts thinking again, that is, the terminal is inactive while waiting at the CPU, and it cannot break down. All random variables involved in the model construction are assumed to be exponentially distributed and independent of each other. The aim of this paper is to investigate the effect of different service disciplines, such as FIFO, processor sharing, priority processor sharing, and polling, on the main performance measures, such as utilizations, response times, throughput, and mean queue length.

Full Text
Paper version not known

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 call

Disclaimer: 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.