The paging drum queue: A uniform perspective and further results
From MaRDI portal
Publication:792089
DOI10.1007/BF00271643zbMATH Open0536.68044OpenAlexW2068383768MaRDI QIDQ792089FDOQ792089
Authors: Clement H. C. Leung, Qui Hoon Choo 
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00271643
Recommendations
- Queue-based random-access algorithms: fluid limits and stability issues
- On the separation and equivalence of paging strategies
- Bounding the performance of tandem queues with finite buffer spaces
- Queueing systems with random volume customers and a sectorized unlimited memory buffer
- Performance bounds for nonhomogeneous queues
- On the relative dominance of paging algorithms
- On the Relative Dominance of Paging Algorithms
- On the smoothness of paging algorithms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
- Title not available (Why is that?)
- The Waiting Time Process for a Generalized Correlated Queue with Exponential Demand and Service
- An Analysis of Drum Storage Units
- Response Time of a Fixed-Head Disk to Transfers of Variable Length
- A Class of FIFO Queues Arising in Computer Systems
- Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System
- A Priority Queuing System with Server-Walking Time
- Optimizing the Performance of a Drum-Like Storage
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: The paging drum queue: A uniform perspective and further results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792089)
