Share Email Print

Proceedings Paper

Two-stage polling system with multiple servers
Author(s): Wai Sum Lai; David J. Houck; Steven W. Fuhrmann
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 10 October 1997
PDF: 11 pages
Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); doi: 10.1117/12.290443
Show Author Affiliations
Wai Sum Lai, AT&T Labs. (United States)
David J. Houck, AT&T Labs. (United States)
Steven W. Fuhrmann, AT&T Labs. (United States)

Published in SPIE Proceedings Vol. 3231:
Performance and Control of Network Systems
Wai Sum Lai; Hisashi Kobayashi, Editor(s)

© SPIE. Terms of Use
Back to Top