The analysis and simulation of multi-access computer systems

Digitisation of this thesis was sponsored by Arcadia Fund, a charitable fund of Lisbet Rausing and Peter Baldwin

Analysis of a Multiprocessor Guidance Computer

The design of the next generation of spaceborne digital computers is described. It analyzes a possible multiprocessor computer configuration. For the analysis, a set of representative space computing tasks was abstracted from the Lunar Module Guidance Computer programs as executed during the lunar landing, from the Apollo program. This computer performs at this time about 24 concurrent functions, with iteration rates from 10 times per second to once every two seconds. These jobs were tabulated in a machine-independent form, and statistics of the overall job set were obtained. It was concluded, based on a comparison of simulation and Markov results, that the Markov process analysis is accurate in predicting overall trends and in configuration comparisons, but does not provide useful detailed information in specific situations. Using both types of analysis, it was determined that the job scheduling function is a critical one for efficiency of the multiprocessor. It is recommended that research into the area of automatic job scheduling be performed

SIMULATION OF A MULTIPROCESSOR COMPUTER SYSTEM

The introduction of computers and software engineering in telephone switching systems has dictated the need for powerful design aids for such complex systems. Among these design aids simulators - real-time environment simulators and flat-level simulators - have been found particularly useful in stored program controlled switching systems design and evaluation. However, both types of simulators suffer from certain disadvantages. An alternative methodology to the simulation of stored program controlled switching systems is proposed in this research. The methodology is based on the development of a process-based multilevel hierarchically structured software simulator. This methodology eliminates the disadvantages of environment and flat-level simulators. It enables the modelling of the system in a 1 to 1 transformation process retaining the sub-systems interfaces and, hence, making it easier to see the resemblance between the model and modelled system and to incorporate design modifications and/or additions in the simulator. This methodology has been applied in building a simulation package for the System X family of exchanges. The Processor Utility Sub-system used to control the exchanges is first simulated, verified and validated. The application sub-systems models are then added one level higher_, resulting in an open-ended simulator having sub-systems models at different levels of detail and capable of simulating any member of the System X family of exchanges. The viability of the methodology is demonstrated by conducting experiments to tune the real-time operating system and by simulating a particular exchange - The Digital Main Network Switching Centre - in order to determine its performance characteristics.The General Electric Company Ltd, GEC Hirst Research Cent, Wemble

Models To Estimate Arrival Counts And Staffing Requirements In Nonstationary Queueing Systems Applied To Long Distance Road Races

We examine the problem of staffing refreshment stations at a long distance road race. A race is modeled as a mixed queueing network in which the required number of servers at each service station has to be estimated. Two models to represent the progress of runners along a long distance road race course are developed. One model is a single-class model that allows a road race manager to staff service stations assuming the runners are identical to those in some historical dataset. Another model is a multi-class simulation model that allows a road race manager to simulate a race of any number of runners, classified based on their running pace into different runner classes. Both the single-class model and the multi-class model include estimates for the rates at which the runners arrive at specified locations along the course. The arrival rates, combined with assumed service rates, allow us to base staffing decisions on the Erlang loss formula or a lesser known staffing rule that gives a lower bound for the required number of servers. We develop a staffing strategy that we call the Peak Arrival Staffing Bound (PASB), which is based on this staffing bound. The PASB and the Erlang loss formula are implemented in the single-class model and the multi-class simulation model. By way of numerical experiments, we find that the PASB is numerically stable and can be used to get staffing results regardless of the traffic intensity. This finding is in contrast to the Erlang loss formula, which is known to become numerically unstable and overflows when the traffic intensity exceeds 171. We compare numerical results of the PASB and the Erlang loss formula with a blocking probability level of 5% and find that when iii the traffic intensity is high, staffing results based on the PASB are more conservative than staffing results based on the Erlang loss formula. As the traffic intensity gets lower, we find that staffing results based on the PASB are similar to staffing results based on the Erlang loss formula. These findings suggest that the PASB can be a valuable tool to aid race directors in making staffing decisions for races of all traffic intensitie