Modular expansion in a class of homogeneous networks
Pages 95 - 100
Abstract
We consider a special class of homogeneous computer network comprising several essentially identical but independent computing systems (ICSs) sharing a single resource. Of interest here are the effects of modularly expanding the network by adding ICSs. We use a previously presented approximate queueing network model to analyze modular expansion in this class of network. The performance measure used in this analysis is the mean cycle time, which is the mean time between successive requests for service by the same job at the CPU of an ICS. In this analysis we derive an intuitively satisfying mathematical relation between the addition of ICSs and the incremental increase in the service rate of the shared resource required to maintain the existing level of system performance.
References
[1]
Basket, F., Chandy, K., Muntz, R. and Palacios, F. "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers", J.ACM, VOL. 22, No. 5, pp 248-260, Apr. 1975.
[2]
Bruell, S. C. and Balbo, G. Computational Algorithms for Closed Queueing Networks, Elsevier North Holland, Inc., Limerick, Ireland, 1980.
[3]
Buzen, J. P. "Queueing Network Models of Multiprogramming", Ph.D. Dissertation, Harvard University, 1971.
[4]
Buzen, J. P. "Computational Algorithms for Closed Queueing Networks with Exponential Servers", C.ACM, Vol. 16, No. 9, pp 527-531, Sept. 1973.
[5]
Coffman, E. G. Jr. and Denning, P. J. Operating Systems Theory, Printice-Hall, Inc., N.J., 1973.
[6]
Hoagland, A. S. "Storage Technology: Capabilities and Limitations", IEEE Computer, Vol. 12, No. 5, pp 12-18, May 1979.
[7]
Kleinrock, L. Queueing Systems Volume II: Computer Applications, John Wiley and Sons, Inc., N.Y., 1976.
[8]
Mink, A. "An Analytic Study of a Shared Device Among Independent Computing Systems", Ph.D. Dissertation, University of Maryland, 1980.
[9]
Mink, A. and Silio, C. B. "A Queueing Network Model of a Shared Device Among Independent Computing Systems", Proc. of the 15th Annual Conf. on Information Sciences and Systems, The John Hopkins University, Baltimore, Md., pp 418-423, Mar. 1981.
[10]
Mink, A. and Silio, C. B. "An Approximate Queueing Network Model of a Shared Device Among Independent Computing Systems", Proc. of COMPCON Fall 1981, Wash., D.C., pp 156-166, Sept. 1981.
[11]
Muntz, R. R. and Wong, J. W. "Efficient Computational Procedures for Closed Queueing Network Models", Proc. of the Seventh Hawaii International Conference on System Sciences, Honolulu, Hawaii, pp 33-36, Jan. 1974.
[12]
Shum, A. W. "Queuing Models for Computer Systems with General Service Time Distribution", Ph.D. Dissertation, Harvard Univ., Dec 1976.
[13]
Thornton, J. E. "Back-End Network Approaches", IEEE Computer, Vol. 13, No. 2, pp 10-17, Feb. 1980.
[14]
Warnar, R. B. J., Calomeris, P.J. and Recicar, S. A. "Computer peripherial Memory Systems Forecast", National Bureau of Standards, Washington, D. C., NBS #SP500-45, Apr. 1979.
[15]
Watson, R. W. "Network Architecture Design for Back-End Storage Networks", IEEE Computer, Vol. 13, No. 2, pp 32-48, Feb 1980.
Index Terms
- Modular expansion in a class of homogeneous networks
Recommendations
Modular expansion in a class of homogeneous networks
Proceedings of the Computer Network Performance SymposiumWe consider a special class of homogeneous computer network comprising several essentially identical but independent computing systems (ICSs) sharing a single resource. Of interest here are the effects of modularly expanding the network by adding ICSs. ...
A traffic based decomposition of two-class queueing networks with priority service
This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the ...
Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
While many single station queues possess explicit forms for their equilibrium probabilities, queueing networks are more problematic. Outside of the class of product form networks (e.g., Jackson, Kelly, and BCMP networks), one must resort to bounds, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 1982168 pages
Copyright © 1982 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1982
Published in SIGMETRICS Volume 11, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 164Total Downloads
- Downloads (Last 12 months)41
- Downloads (Last 6 weeks)5
Reflects downloads up to 22 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in