Cited By
View all- Saini MAtrey PKankanhalli M(2013)Workload Modeling for Multimedia Surveillance SystemsEmerging Paradigms in Machine Learning10.1007/978-3-642-28699-5_16(419-440)Online publication date: 2013
Queueing network models of multimicrocomputer networks
Pages 190 - 197
Abstract
Recent developments in very large scale integration have made it feasible to construct a highly parallel computer composed of large numbers of interconnected microcomputers. The modeling problems posed by this approach to parallel processing differ in several significant respects from those associated with traditional queueing network models of computer systems. Among them are the size of the models, the varied interconnection network topologies, and algorithm dependent internode communication patterns. We extend queueing theoretic models to include multimicrocomputer networks with primary emphasis on two areas: characterizing interconnection network workloads and finding efficient solution techniques for the resulting models.
References
[1]
F. Baskett, K. M. Chandy, R.R. Muntz, and F. G. Palacios, "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers," Journal of the ACM, Vol. 22, No. 2, April 1975, pp. 248-260.
[2]
J. P. Buzen, "Computational Algorithms for Closed Queueing Networks with Exponential Servers," Communications of the ACM, Vol. 16, No. 9, September 1973, p. 527-531.
[3]
P. J. Denning and J. P. Buzen, "The Operational Analysis of Queueing Network Models," ACM Computing Surveys, Vol. 10, No. 3, September 1978, pp. 225-261.
[4]
A. M. Despain and D. A. Patterson, "X-TREE: A Tree Structured Multiprocessor Computer Architecture, " Proceedings of the Fifth Annual Symposium on Computer Architecture, ACM Sigarch Newsletter, Vol. 6, No. 7, April 1978, pp. 144-151.
[5]
D. A. Reed and H. D. Schwetman, "Cost-Performance Bounds for Multimicrocomputer Networks," IEEE Transactions on Computers, Vol. C-32, January 1983, pp. 83-95.
[6]
D. A. Reed, "Performance Based Design and Analysis of Multimicrocomputer Networks," PhD Dissertation, Purdue University, May 1983.
[7]
M. Reiser, and S. S. Lavenberg, "Mean Value Analysis of Closed Multiclass Queueing Networks," Journal of the ACM. Vol. 27, No. 2, April 1980, pp. 313-323.
[8]
C. U. Smith and D. D. Loendorf, "Performance Analysis of Software for MIMD Computer," Proceedings of the 1982 ACM Symposium on Measurement and Modeling of Computer Systems, ACM Performance Evaluation Review, Vol. 11, No. 4, pp. 151-162. 1980, pp. 328-334.
[9]
L. D. Wittie, "Communication Structures for Large Multimicrocomputer Systems," IEEE Transactions on Computers, Vol. C-30, April 1981, pp. 264-273.
[10]
J. Zahorjan, K. C. Sevcik, D. L. Eager, and B. Galler, "Balanced Job Bound Analysis of Queueing Networks," Communications of the ACM, Vol. 25, No. 2, February 1982, pp. 134-141.
Index Terms
- Queueing network models of multimicrocomputer networks
Recommendations
Cost-Performance Bounds for Multimicrocomputer Networks
Several interconnection structures for a distributed multimicrocomputer message-passing system are compared on the basis of cost and performance. Among the structures analyzed are buses, double rings, D-dimensional toroids, trees, cube-connected cycles, ...
Stability of Multiclass Queueing Networks Under FIFO Service Discipline
In this paper, we first formally identify a FIFO fluid network that corresponds to the queueing network under a first-in first-out FIFO service discipline, thus complementing the result of Dai Dai, J. G. 1995a. On positive Harris recurrence of ...
Stability of Multiclass Queueing Networks Under FIFO Service Discipline
In this paper, we first formally identify a FIFO fluid network that corresponds to the queueing network under a first-in first-out FIFO service discipline, thus complementing the result of Dai Dai, J. G. 1995a. On positive Harris recurrence of ...
Comments
Information & Contributors
Information
Published In
August 1983
286 pages
Copyright © 1983 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 August 1983
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 459 of 2,691 submissions, 17%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 188Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)1
Reflects downloads up to 04 Nov 2024
Other Metrics
Citations
Cited By
View all- Saini MAtrey PKankanhalli M(2013)Workload Modeling for Multimedia Surveillance SystemsEmerging Paradigms in Machine Learning10.1007/978-3-642-28699-5_16(419-440)Online publication date: 2013
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in