### A Generalized Multi-Entrance Time-Sharing Priority QueueA Generalized Multi-Entrance Time-Sharing Priority Queue

Access Restriction
Subscribed

 Author Babad, Jair M. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1975 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract A generalized multi-entrance and multipriority M/G/1time-sharing system is dealt with. The system maintains manyseparate queues, each identified by two integers, the prioritylevel and the entry level The arrival process of users is ahomogenous Poisson process, while service requirements areidentically distributed and have a finite second moment. Uponarrival a user joins one of the levels, through the entry queue ofthis level. In the (n, k)-th queue, where $\textit{n}$ is thepriority level and $\textit{k}$ is the entry level, a user is eligibleto a (finite or infinite) quantum of service. If the servicerequirements of the user are satisfied during the quantum, the userdeparts, and otherwise he is trans- ferred to the end of the (n+ 1, k)-th queue for additional service. When a quantum ofservice is completed, the highest priority nonempty level is chosento be served next; within this level the queues are scannedaccording to the priority of their entry level, and the user at thehead of the highest priority nonempty queue is chosen to be served.In such a priority discipline, preferred users always get animproved service, though the service of all users is degraded inproportion to their service requirements. Expected flow times andexpected number of waiting users are derived and then specializedto the head-of-the-line M/G/1 priority discipline (in which quantahave infinite length and service is uninterrupted) and to $theFB_{n}$ time-sharing system. Finally, the generalizedmultientrance and multipriority time-sharing discipline is(numerically) compared with several other time-sharing systems. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1975-04-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 22 Issue Number 2 Page Count 17 Starting Page 231 Ending Page 247

#### Open content in new tab

Source: ACM Digital Library