J. W. Wong's research while affiliated with University of Waterloo and other places

Publications (7)

Article
Simulation, particularly of networks of queues, is an application with a high degree of inherent parallelism, and is of considerable practical interest. We continue the analysis of synchronization methods for distributed simulation, defined by the taxonomy in our previous paper. Specifically, we develop algorithms for time-driven simulation using a...
Article
Simulation, particulary of networks of queues, is an application with a high degree of inherent parallelism and is of great practical interest. We hope to exploit this parallelism by performing simulations using a network of cheap, but slow, micro-processors.We define a taxonomy by which we classify a number of parameters of a distributed simulatio...
Article
Discrete simulation is a widely used technique for system performance evaluation. The conventional approach to discrete simulation (e.g., GPSS, Simscript) does not attempt to exploit the parallelism typically available in queueing network models. In this paper, a distributed approach to discrete simulation is presented. It involves the decompositio...
Article
An open queueing network model is used to derive the distribution of end-to-end delay in a message-switched network. It is shown that under fixed routing, the end-to-end delay of messages belonging to a particular source-destination node pair is given by a sum of independent and exponentially distributed random variables. The generalization of this...

Citations

... Different object-oriented based approach for concurrent simulation have been proposed in the literature [10,6]. Jefferson and Sowizral [8] worked on a mechanism called Time Warp which is based on discrete event based simulation. ...
... 1 To the best of our knowledge, the first discrete event synchronization algorithms were published in the late seventies [37], around the same time that Lamport [40] published his seminal paper regarding the ordering of events in distributed process networks. Discrete event simulators compute the behavior of a system by isolating the most important events and computing the state evolution of the system from one event to the next [22]. ...
... where θ s k s k+1 is defined in (38). The distribution function of (51) with KIA may first be found by Wong in 1978 [23] and was also used in Popescu and Constantinescu's work [19]. ...
... Examples of conservative mechanisms include Chandy, Misra and Byrant's NMP [5], and Peacock, Manning, and Wong [16] avoided deadlock through null messages. Some intelligent approaches to null message generation include generation on demand [17], and generation after a time-out [18]. Some earlier research on DES has focused on variants of NMP, with the objective of reducing the high null message overhead. ...