Abstract
finite-source queuing model (sometimes called the finite-population, machine-interference, or machine-repairman model), which has often been used in analyzing time-sharing systems and multi- programmed computer systems, is invesugated. The model studied here has two service staUons, a processor (single server) and peripherals (infinite server), and a finite number of customers (or jobs) that have a distract service rate at the processor. The model is in eqmhbnum. It is shown that the utilization factor of the processor can be obtained in an analyuc form and ts independent of various scheduling disciphnes employed at the processor, such as FCFS, generahzed processor sharing, preempUve (resume) and nonpreemptwe priority disciphnes, under some condiaon. Other relevant propemes of this model are also shown. The range within which these properties hold is discussed, and some examples are given. Examples of appficatlon to multiprogrammmg and tune-sharing systems are given; in particular, It Is shown that the often used dynamic dispatching pohcy (which gwes the higher preempuve priority to the more I/O oriented job) is optimal within the framework of this multiprogramming model. Categories and SubJect Descriptors:
Sign-in/Register to access full text options 
Free) 
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
