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

DOI10.1016/J.JCSS.2010.08.002MaRDI QIDQ635140zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

gate-limited serviceMarkov modelsprefetching

Mathematics Subject Classification ID

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

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

• Exploring gate-limited analytical models for high-performance network storage servers
• scientific article; zbMATH DE number 3764811 (Why is no real title available?)
• scientific article; zbMATH DE number 729460 (Why is no real title available?)
• scientific article; zbMATH DE number 1416627 (Why is no real title available?)
• Iterative approximation of \(k\)-limited polling systems
• Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
• 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

Cited in

(2)

• Impact of resource locking on performance of web-based applications
• Exploring gate-limited analytical models for high-performance network storage servers

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)