Exploring gate-limited analytical models for high-performance network storage servers
From MaRDI portal
Publication:635140
DOI10.1016/J.JCSS.2010.08.002zbMATH Open1219.68071OpenAlexW4241701215MaRDI QIDQ635140FDOQ635140
Authors: Glenford Mapp, Dhawal Thakker, Orhan Gemikonakli 
Publication date: 19 August 2011
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2010.08.002
Recommendations
- Impact of resource locking on performance of web-based applications
- Stationary analysis of infinite queueing system with two-stage network server
- Modelling priority queuing systems with varying service capacity
- Cloud data storage: a queueing model with thresholds
- Allocation of service time in a multiserver system
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
- Title not available (Why is that?)
- Queuing analysis of polling models
- Iterative approximation of \(k\)-limited polling systems
- Pseudo-conservation laws in cyclic-service systems with a class of limited service policies
- Simplified Analysis of an Alternating-Priority Queuing Model with Setup Times
- Exploring gate-limited analytical models for high-performance network storage servers
Cited In (2)
This page was built for publication: Exploring gate-limited analytical models for high-performance network storage servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635140)
