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.     

Three-valued derived logics for classical phase spaces

Reichenbach proposed a three-valued logic to describe quantum mechanics. In his development, Reichenbach presented three different negation operators without providing any criteria for choosing among them. In this paper we develop two three-valuedderived logics for classical systems. These logics are derived in that they are based on a theory of physical measurement. In this regard they have some of the characteristics of the quantum logic developed by Birkhoff and von Neumann. The theory of measurement used in the present development is the one used previously in developingbivalent derived logics for classical systems. As these systems are derived logics, many of the ambiguities possessed by systems such as Reichenbach's are avoided.