article

Free access

Solution of closed, product form, queueing networks via the RECAL and tree-RECAL methods on a shared memory multiprocessor

Authors:

A. G. Greenberg,

J. McKennaAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 17, Issue 1

Pages 127 - 135

https://doi.org/10.1145/75372.75386

Published: 01 April 1989 Publication History

PDF eReader

Abstract

RECAL is a new recurrence relation for calculating the partition function and various queue length moments for closed, product form networks. In this paper we discuss a number of the issues involved in the software implementation of RECAL on both sequential computers and parallel, shared memory computers. After a brief description of RECAL, we describe software implementing RECAL on a sequential computer. In particular, we discuss the problems involved in indexing and data storage. Next we describe code implementing RECAL on a parallel, shared memory computer. Special attention is given to designing a special buffer for temporary data storage and several other important features of the parallel code. Finally, we touch on software for serial and parallel implementations of a tree algorithm for RECAL.

References

[1]

Conway, A. E. and Georganas, N. D., "RECAL, a new efficient algorithm for the exact analysis of multiple-chain closed queueing networks", j. ACM 33, 4 (October 1986), 768-791.

Digital Library

Google Scholar

[2]

McKenna, J. "A new proof and a tree algorithm for RECAL". Stochastic Models, 4, 2 (1988), 235-276.

Google Scholar

[3]

Lain, S. S. and Lien, Y. L., "A tree convolution algorithm for the solution of queueing networks". Commun. ACM 26, 3 (March 1983), 203-215.

Digital Library

Google Scholar

[4]

Lavenberg, S. S., "Computer Performance Modeling Handbook", Academic Press, New York, 1983.

Digital Library

Google Scholar

[5]

McKenna, J. "Calculating joint queue length moments with RECAL". To appear.

Google Scholar

[6]

Basket, F., Chandy, K. M, Muntz, R. R. and Palacios, F, G., "Open, closed, and mixed networks of queues with different classes of customers". J. ACM 22, 2 (1975), 248-260.

Digital Library

Google Scholar

[7]

Kelly, F.P., "Networks of queues with customers of different types". J. Appl. Prob. 12 (1978), 542-554.

Crossref

Google Scholar

[8]

Kelly, F. P., "Networks of queues". Adv. Appl. Prob. $ (1976), 416-432.

Google Scholar

[9]

Nijenhuis, A. and Wilf, S., "Combinatorial Algorithms, second edition", Academic Press, New York, 1978.

Digital Library

Google Scholar

[10]

George, A. and Liu, W. L., "Computer Solution of Large Sparse Positive Definite Systems", Prentice Hall, Englewood Cliffs, 1981.

Digital Library

Google Scholar

[11]

Gustafson, J.L., Montry, G.R., and Benner, R.E., "Development of Parallel Methods for a 1024-Processor Hypercube," Siam J. Sci. Stat. Comput., 9, 4 (July 1988) 609-638.

Digital Library

Google Scholar

[12]

Aho, A.V., Hopcroft, J.E., and Ullman, J.D., "The Design and Analysis of Computer Algorithms", Addison-Wesley Publishing Co., Reading, Mass., 1976.

Digital Library

Google Scholar

Cited By

View all

McKenna J(2007)Calculating joint queue length moments with recalCommunications in Statistics. Stochastic Models10.1080/153263491088071757:1(47-66)Online publication date: 21-Mar-2007
https://doi.org/10.1080/15326349108807175
Hanson FMei JTier CXu H(1993)PDACParallel Computing10.1016/0167-8191(93)90080-519:12(1345-1358)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1016/0167-8191%2893%2990080-5

Index Terms

Solution of closed, product form, queueing networks via the RECAL and tree-RECAL methods on a shared memory multiprocessor

Recommendations

Solution of closed, product form, queueing networks via the RECAL and tree-RECAL methods on a shared memory multiprocessor
SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

RECAL is a new recurrence relation for calculating the partition function and various queue length moments for closed, product form networks. In this paper we discuss a number of the issues involved in the software implementation of RECAL on both ...
Incorporating non product form stations into otherwise product form closed queueing networks
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

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 17, Issue 1

May 1989

209 pages

ISSN:0163-5999

DOI:10.1145/75372

Editor:
Blaine D. Gaither
Gould Inc., San Diego, CA

Issue’s Table of Contents

SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
April 1989
242 pages
ISBN:0897913159
DOI:10.1145/75108
Chairman:
Domenico Ferrari
Univ. of California, Berkeley

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Published in SIGMETRICS Volume 17, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
254
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

McKenna J(2007)Calculating joint queue length moments with recalCommunications in Statistics. Stochastic Models10.1080/153263491088071757:1(47-66)Online publication date: 21-Mar-2007
https://doi.org/10.1080/15326349108807175
Hanson FMei JTier CXu H(1993)PDACParallel Computing10.1016/0167-8191(93)90080-519:12(1345-1358)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1016/0167-8191%2893%2990080-5

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations