Several pseudorandom number generators are described and compared on the basis of cost of generation and length of period of the sequences that are produced. The major statistical tests, which are used to obtain a measure of randomness for the different generators are discussed and compared. Four pseudorandom number generators are programmed in GPSS and are used to generate interarrival and service times for an M/M/1 queuing system. The results of each of the trials are compared to the theoretical results which can be obtained from queuing theory.
| Identifer | oai:union.ndltd.org:ucf.edu/oai:stars.library.ucf.edu:rtd-1495 |
| Date | 01 October 1980 |
| Creators | Landauer, Edwin G. |
| Publisher | University of Central Florida |
| Source Sets | University of Central Florida |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Retrospective Theses and Dissertations |
| Rights | Public Domain |
Page generated in 0.0017 seconds