Solution of Closed, Product Form, Queueing Networks via the RECAL and Tree-RECAL Methods on a Shared Memory Multiprocessor

@inproceedings{Greenberg1989SolutionOC,
  title={Solution of Closed, Product Form, Queueing Networks via the RECAL and Tree-RECAL Methods on a Shared Memory Multiprocessor},
  author={Albert G. Greenberg and James McKenna},
  booktitle={SIGMETRICS},
  year={1989}
}
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… CONTINUE READING