About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of the ACM
Paper
Probability Models for Buffer Storage Allocation Problems
Abstract
This paper considers some of the issues that arise when messages or jobs inbound to a computer facility are buffered prior to being processed. Models are developed that describe (a) the results of blocking a single memory unit for the use of diverse messages, (b) the occupancy behavior of a buffer that is tied to a single message source, and (c) the occupancy of a buffer dynamically shared among many independent sources. © 1971, ACM. All rights reserved.