Exploring gate-limited analytical models for high-performance network storage servers

DOI10.1016/j.jcss.2010.08.002zbMath1219.68071OpenAlexW4241701215MaRDI QIDQ635140

Orhan Gemikonakli, Dhawal Thakker, Glenford Mapp

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

zbMATH Keywords

prefetchingMarkov modelsgate-limited service

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Exploring gate-limited analytical models for high-performance network storage servers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploring gate-limited analytical models for high-performance network storage servers
• Iterative approximation of \(k\)-limited polling systems
• Pseudo-conservation laws in cyclic-service systems with a class of limited service policies
• Queuing analysis of polling models
• Simplified Analysis of an Alternating-Priority Queuing Model with Setup Times

This page was built for publication: Exploring gate-limited analytical models for high-performance network storage servers