Skip Navigation

IMA Journal of Applied Mathematics 1978 22(4):435-441; doi:10.1093/imamat/22.4.435
© 1978 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by LAM, C. F.
Right arrow Articles by PEDERSEN, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Solving Large Sets of Differential Equations Describing Queueing Systems with the Aid of a Dynamic Allocation Algorithm

C. F. LAM and J. PEDERSEN

Department of Biometry, Medical University of South Carolina Charleston, South Carolina 29403, U.S.A.
U.S.D.A. Forest Service, Southeastern Forest Experiment Station, Forestry Sciences Laboratory Research Triangle Park, North Carolina 27709, U.S.A.

The number of differential equations associated with a queueing system is usually very large; it is not unusual for the number to be in the thousands. Thus, most queueing systems are studied under steady-state conditions or simulated discretely using such systems as GPSS and Simscript. This paper presents an algorithm that dynamically adjusts and keeps the number of differential equations to be solved at a minimum at every integration step. This makes the continuous simulation of queueing systems practical since the required computer memory and time is reduced.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.