Referenced Items are not available for this document.
Using the framework of cyclic-service systems with a single server, two different token-passing models are investigated. The first model is approximate, obtaining the free-tokens cycle-time distribution on an asymmetric system with infinite capacity buffers and single-token operation. The second model is exact, yielding the cycle-time distribution of the free token on an asymmetric system with unit-capacity buffers, and single-token operation. The latter result is verified using known results for symmetric, unit-capacity buffer systems. To demonstrate the positive effects of buffering, a small variation of the unit-capacity buffering scheme is introduced. Computational results include performance measures such as throughput, utilization, loss probabilities, mean cycle times, cycle-time distributions, and a comparison of two buffering schemes
Published in:
Computers, IEEE Transactions on
(Volume:37
,
Issue:
10
)
Date of Publication: Oct 1988
- Page(s):
- 1224 - 1234
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 3300028
- Digital Object Identifier :
- 10.1109/12.5984
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct 1988
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
