๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Quantization-based filtering in distributed discrete event simulation

โœ Scribed by Bernard P Zeigler; Hyup J Cho; Jeong G Kim; Hessam S Sarjoughian; Jong.S Lee


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
597 KB
Volume
62
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


Quantization is an approach to distributed logical simulation in which the value space is quantized and trajectories are represented by the crossings of a set of thresholds. This is an alternative to the common approach which discretizes the time base of a continuous trajectory to obtain a finite number of equally spaced sampled values over time. In distributed simulation, a quantizer checks for threshold crossings whenever an output event occurs and sends this value across to a receiver thereby reducing the number of messages exchanged among federates in a federation. This may increase performance in various ways such as decreasing overall execution time or allowing a larger number of entities to be simulated. Predictive quantization is a more advanced approach that sends just one bit of information instead of the actual real value size with the consequence that not only the number of messages, but also the message size, can be significantly reduced in this approach. In this paper, we present an approach to packaging individual bits into a large message packet, called multiplexed predictive quantization. We demonstrate that this approach can save significant overhead (thereby maximizing data transmission) and can reach close to 100% efficiency in the limit of large numbers of simultaneous message sources encapsulated within individual federates. We also discuss the tradeoff between message bandwidth utilization and the error incurred in the quantization. The results relate bandwidth utilization and error to quantum size for federations executing in the HLA-compliant discrete event distributed simulation environment, DEVS/HLA. The theoretical and empirical results indicate that quantization can be very scaleable due to reduced local computation demands as well as having extremely favorable network load reduction/simulation fidelity tradeoffs.


๐Ÿ“œ SIMILAR VOLUMES


Fornax: Web-based distributed discrete e
โœ Halderen, Berry A. W. Van; Overeinder, Benno J. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 104 KB ๐Ÿ‘ 3 views

In this paper we present an environment for the development of Java-based discrete event simulations. An integrated approach is taken that combines discrete event semantics with Java and exceeds the expressiveness of discrete event libraries. The environment supports advanced techniques including di

On Terminating a Distributed Discrete Ev
โœ Y.B. Lin ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 593 KB

This paper studies the termination problem for a distributed discrete event simulation in a computing environment where message sending does not preserve FIFO property (i.e., the messages may not be delivered in the order they are sent). The distributed simulation considered is synchronized by a rol

An Adaptive Partitioning Algorithm for D
โœ Azzedine Boukerche ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 277 KB

Biocomputing techniques have been proposed to solve combinatorial problems elegantly by such methods as simulated annealing, genetic algorithms and neural networks. In this context, we identify an important optimization problem arising in conservative distributed simulation, such as partitioning, sy

JTED: parallel discrete-event simulation
โœ Cowie, James ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 54 KB ๐Ÿ‘ 3 views

A useful discrete-event simulation environment should support component-level reuse, integration of graphical tools, and scalable performance. The JTED framework (http://www.cooperate.com/JTED) demonstrates that Java can serve as the basis for constructing very large models that achieve these goals.

Discrete event simulation in C with DISC
โœ Sathyakumar Selvaraj; Eric L. Blair; Milton L. Smith; William M. Marcy ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 822 KB
Multiple use of random numbers in discre
โœ Thomas Kรคmpke ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 444 KB

A method is presented for using a single (0,l) uniform random number to yield stochastically independent random numbers having a given finite distribution. The adaption of the alias method to the given procedure is outlined. An application to simulate Brownian motion is given.