This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Study of Achievable Speedup in Distributed Simulation via NULL Messages
March 1993 (vol. 4 no. 3)
pp. 347-354

The results of an experimental study on distributed simulation of three open queuingnetworks are reported. The distributed simulation scheme considered is a simple variationof the scheme given by K.M. Chandy and J. Misra (1979) using NULL messages. A newapproach is used to study the relationship between the overhead and performance of adistributed simulator, and the approach is illustrated by studying these three examplenetworks. Two measures of ideal speedup of distributed simulation over sequentialsimulation are defined and measured. These values of ideal speedup are much less thansimply the number of processors, and hence provide a more realistic value for the ideal speedup.

[1] R. Bagrodia, "May: A process based simulation language," Master's Rep., Dep. Comput. Sci., Univ. of Texas at Austin, Austin, TX, 1983.
[2] K. M. Chandy and J. Misra, "Distributed simulation: A case study in design and verification of distributed programs,"IEEE Trans. Software Eng., vol. SE-5, no. 5, pp. 440-452, Sept. 1079.
[3] K.M. Chandy and J. Misra, "Asynchronous Distributed Simulation via a Sequence of Parallel Computations,"Comm. ACM, Vol. 24, No. 4, Apr. 1981, pp. 198-206.
[4] R. M. Fujimoto, "Performance measurements of distributed simulation strategies," inProc. SCS Multiconf. Distributed Simulation, Feb. 3-5, 1988, pp. 14-20.
[5] R. M. Fujimoto, "Lookahead in parallel discrete event simulation," inProc. 1988 Int. Conf. Parallel Processing, Aug. 1988, pp. 34-41.
[6] R. M. Fujimoto, "Time warp on a shared memory multiprocessor," inProc. 1989 Int. Conf. Parallel Processing, Aug. 8-12, 1989, pp. 242-249.
[7] T. Etzion, "Optimal codes for correcting single errors and detecting adjacent errors,"IEEE Trans Inform. Theory, vol. 38, no. 4, pp. 1357-1360, July 1992.
[8] C. A. R. Hoare, "Communicating sequential processes,"Commun. ACM, vol. 21, pp. 666-677, 1978.
[9] D. R. Jefferson and H. A. Sowizral, "Fast concurrent simulation using the time warp mechanism, Part I: local control," Tech. Rep., The Rand Corp., Santa Monica, CA, Dec. 1982.
[10] D. Kumar, "An approximate method to predict performance of a distributed simulation scheme," inProc. 18th Int. Conf. Parallel Processing, St. Charles, IL, Aug. 8-12, 1989, pp. 259-262.
[11] A. Girgensohn and F. Shipman, "Supporting knowledge acquisition by end users: Tools and representations," inProc. Symp. Applied Computing, pp. 310-348, Mar. 1992.
[12] D. Kumar, and S. Harous, "A study of achievable speedup in distributed simulation via NULL messages," inProc. 10th Annu. IEEE Int. Phoenix Conf. Comput. and Commun., Scottsdale, AZ, Mar. 27-30, 1991, pp. 113-119.
[13] J. Misra, "Distributed discrete-event simulation,"Comput. Surveys, vol. 18, no. 1, Mar. 1986.
[14] J. K. Peacock, J. W. Wong, and E. G. Manning, "Distributed simulation using a network of processors,"Comput. Networks, vol. 3, no. 1, pp. 44-56, Feb. 1979.
[15] D. A. Reed, "A simulation study of multimicrocomputer networks," inProc. Int. Conf. Parallel Processing, Aug. 1983, pp. 161-163.
[16] D. A. Reed, A. D. Malony, and B. D. McCredie, "Parallel discrete event simulation using shared memory,"IEEE Trans. Software Eng., vol. 14, no. 4, pp. 541-553, Apr. 1988.
[17] M. Seethalakshmi, "A study and analysis of performance of distributed simulation," Master's Rep., Dep. Comput. Sci., Univ. Texas, Austin, TX 78712, May 1979.

Index Terms:
Index Termsachievable speedup; distributed simulation; NULL messages; open queuing networks;overhead; performance; distributed simulator; computer networks; concurrency control;digital simulation; queueing theory
Citation:
D. Kumar, S. Harous, "A Study of Achievable Speedup in Distributed Simulation via NULL Messages," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 3, pp. 347-354, March 1993, doi:10.1109/71.210817
Usage of this product signifies your acceptance of the Terms of Use.