Paper
10 October 1997 Two-stage polling system with multiple servers
Wai Sum Lai, David J. Houck, Steven W. Fuhrmann
Author Affiliations +
Proceedings Volume 3231, Performance and Control of Network Systems; (1997) https://doi.org/10.1117/12.290443
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
Abstract
We investigate the impact of scheduling policies on the tail distribution of sojourn times experienced by various unevenly-loaded queues in a two-stage polling system served by a symmetric multiprocessor system running under a Unix- like operating system. The queues are statically divided into groups, with each group being managed by a process. A process can run on any of the available processors. Service to a customer is thus scheduled first at the process level and then at the queue level. Assuming that all customers have the same service requirement, and for Poisson arrivals and exponentially distributed service times and setup times, it is shown by simulation that the earliest-customer policy outperforms both 1-limited and exhaustive policies in the sense of providing equitable service to the queues.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wai Sum Lai, David J. Houck, and Steven W. Fuhrmann "Two-stage polling system with multiple servers", Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); https://doi.org/10.1117/12.290443
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Operating systems

Systems modeling

Telecommunications

C++

Distributed computing

Process modeling

Roads

Back to Top