Diffusion approximations for storage processes in computer systems

Authors:
E. G. Coffman, Jr.;M. I. Reiman
Affiliations:
Bell Laboratories, Murray Hill, New Jersey;Bell Laboratories, Murray Hill, New Jersey
Venue:
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1983

Citing 3
Cited 2

Probability Models for Buffer Storage Allocation Problems

Journal of the ACM (JACM)
On Approximate Computer System Models

Journal of the ACM (JACM)
Analyzing queueing networks with simultaneous resource possession

Communications of the ACM

Channel fragmentation in dynamic spectrum access systems: a theoretical study

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A performance analysis of channel fragmentation in dynamic spectrum access systems

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we focus on the storage resource. A basic model of the space time requirements of jobs in a computer system is described, and a number of its variations analyzed by means of diffusion approxmiations. Subject to the usual heavy traffic assumptions, the result of this analysis enable one to quantify the effects of limitations on both storage capacity and processing rates.