Polling and greedy servers on a line
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
A single server moves with speed υ on a line interval (or a circle) of length (circumference)L. Customers, requiring service of constant durationb, arrive on the interval (or circle) at random at mean rate λ customers per unit length per unit time. A customer's mean wait for service depends partly on the rules governing the server's motion. We compare two different servers: thepolling server and thegreedy server. Without knowing the locations of waiting customers, a polling server scans endlessly back and forth across the interval (or clockwise around the circle), stopping only where it encounters a waiting customer. Knowing where customers are waiting, a greedy server always travels toward the current nearest one. Except for certain extreme values of υ,L, b, andλ, the polling and greedy servers are roughly equally effective. Indeed, the simpler polling server is often the better. Theoretical results show, in most cases, that the polling server has a high probability of moving toward the nearest customer, i.e. moving as a greedy server would. The greedy server is difficult to analyze, but was simulated on a computer.
- E.G. Coffman, Jr. and E.N. Gilbert, A continuous polling system, IEEE Trans. Inf. Th., IT-3 2(1986)5 84.
- E.G. Coffman, Jr. and M. Hofri, On the expected performance of scanning disks, SIAM J. Comput. 11(1982)60.
- E.G. Coffman, Jr. and M. Hofri, Queueing analyses of secondary storage devices, Queueing Systems 1(1986)129.
- R. Geist and S. Daniel, A continuum of disk scheduling algorithms, Tech. Rep., Computer Science Dept., Clemson University, Clemson, NC (1985); see also S. Daniel and R. Geist, V-SCAN: An adaptive disk scheduling algorithm,Proc. IEEE Int. Symp. on Comp. Sys. Org., New Orleans (1983).
- M. Hofri, Disk scheduling: FCFS vs. SSTF revisited, Comm. ACM 23(1980)645.
- L.B.W. Jolley,Summation of Series (Dover Publications, 1961).
- D.E. Knuth,The Art of Computer Programming: Sorting and Searching, Vol. III (Addison-Wesley, Reading, MA, 1973) (see pp. 254–255, 259–264).
- T. Teorey and T. Pinkerton, A comparative analysis of disk scheduling policies, Comm. ACM 15(1972)177.
- Polling and greedy servers on a line
Volume 2, Issue 2 , pp 115-145
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Polling systems
- disk systems
- disk SCAN policy
- shortest-seek-time-first disk scheduling
- moving-server systems
- Industry Sectors