Queueing models of secondary storage devices
From MaRDI portal
Publication:1105369
DOI10.1007/BF01536186zbMath0648.68051MaRDI QIDQ1105369
Micha Hofri, Edward G. jun. Coffman
Publication date: 1986
Published in: Queueing Systems (Search for Journal in Brave)
auxiliary storage systems; computer storage devices; queueing analysis of computer secondary storage; stochastic models of computer auxiliary memory systems
60K25: Queueing theory (aspects of probability theory)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N99: Theory of software
Related Items
Seek distances in two-headed disk systems, Seek distances in disks with two independent heads per surface, Polling and greedy servers on a line
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing systems with vacations - a survey
- Multiple feedback at a single-server station
- Open networks of queues: their algebraic structure and estimating their transient behavior
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Optimally controlled ccd shift registers (optimal interception on a recurrent trajectory)
- Sequencing Problems in Two-Server Systems
- Optimum Head Separation in a Disk System with Two Read/Write Heads
- Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input
- Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks
- On the Expected Performance of Scanning Disks
- An Analysis of Drum Storage Units
- Time-Sharing Service Systems. I
- Moment formulas for the Markov renewal branching process
- Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service times
- A Class of FIFO Queues Arising in Computer Systems
- A Oueueing Model Of A Rotational Position Sensing Disk System
- Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System
- On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
- A Priority Queuing System with Server-Walking Time
- On the moments of Markov renewal processes
- Queues with Periodic Service and Changeover Time
