Accession Number:

ADA059508

Title:

Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies.

Descriptive Note:

Technical rept.,

Corporate Author:

DELAWARE UNIV NEWARK DEPT OF STATISTICS AND COMPUTER SCIENCE

Personal Author(s):

Report Date:

1978-05-01

Pagination or Media Count:

47.0

Abstract:

Consider a finite waiting room shared by several servers. Such a system may approximate, for instance, a packet switch in a communications network or a buffer shared by producer-consumer parallel processes. It is assumed that a customer is lost if he cannot enter the waiting room. Furthermore, the waiting room is partitioned into L1 areas, where L is the number of servers each of the first L areas is reserved for the exclusive use of one server, the L1st is common and may be used by all servers. This allocation policy is referred to as L1- sharing.

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE