Polling and greedy servers on a line

DOI10.1007/BF01158396zbMath0653.90021OpenAlexW2078906366MaRDI QIDQ1108180

E. N. Gilbert, Edward G. jun. Coffman

Publication date: 1987

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158396

zbMATH Keywords

greedy serverdisk SCAN policydisk systemsmoving-server systemspolling servershortest-seek-time-first disk scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (15)

Single-server queues with spatially distributed arrivals ⋮ Controlled mobility in stochastic and dynamic wireless networks ⋮ Stability of polling systems with exhaustive service policies and state-dependent routing ⋮ Stability and performance of greedy server systems ⋮ On the greedy walk problem ⋮ Scaling limit of a limit order book model via the regenerative characterization of Lévy trees ⋮ The critical greedy server on the integers is recurrent ⋮ Stability of a spatial polling system with greedy myopic service ⋮ Continuous polling models and application to ferry assisted WLAN ⋮ A stochastic analysis of hard disk drives ⋮ From polling to snowplowing ⋮ Stability of Polling Networks with State-Dependent Server Routing ⋮ Queueing systems on a circle ⋮ Comments on: ``Polling: past, present and perspective ⋮ Greedy walk on the real line

Cites Work

• Unnamed Item
• Unnamed Item
• Queueing models of secondary storage devices
• On the Expected Performance of Scanning Disks
• A comparative analysis of disk scheduling policies

This page was built for publication: Polling and greedy servers on a line