Massively time-parallel,approximate simulation of loss queueing systems

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.     

Production of helium fragments in197Au-emulsion collisions at 10.6 A GeV

We present a systematic analysis on the helium projectile fragments produced from 10.6 A GeV¹⁹⁷Auemulsion interactions in an experiment conducted at the Brookhaven AGS. Total charge changing and partial production cross-sections are measured experimentally on the basis of helium multiplicity. The multiplicity distribution of helium fragments which are produced collectively obey a KNO scaling. The transverse momentum distribution of these particles indicates that they are produced from two different independent sources.We are thankful to the BNL technical staff and specially to Dr. D. Beavis for his help in the exposure of emulsion stacks. Thanks are due to Profs. Y. Takahashi and G. Romano for their help in the preparation and development of the emulsion stacks. We appreciate the discussions with Prof. H. Stocker and J. Aichelin. This work was supported by D.O.E. under Grant No. DE-FGO2-90ER 40566.