This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Exploiting Lookahead in Parallel Simulation
October 1990 (vol. 1 no. 4)
pp. 457-469

Lookahead is the ability of a process to predict its future behavior. The feasibility of implicit lookahead for non-FCFS stochastic queuing systems is demonstrated. Several lookahead exploiting techniques are proposed for round-robin (RR) system simulations. An algorithm that generates lookahead in O(1) time is described. Analytical models and experiments are constructed to evaluate these techniques. A lookahead technique for preemptive priority (PP) systems is evaluated using an analytical model. The performance metric for these techniques is the lookahead ratio, which is correlated with other performance measures of more direct interest, such as speedup. The analyses show that using implicit lookahead can significantly improve the lookahead ratios of RR and PP system simulations.

[1] M. Ajmone Marsan, G. Balbao, and G. Conte,Performance Modeling of Multiprocessor Systems. Cambridge, MA: MIT Press, 1986.
[2] R. M. Fujimoto, "Lookahead in parallel discrete event simulation," inProc. Int. Conf. Parallel Processing, 1988, pp. III-34-41.
[3] R. M. Fujimoto, "Performance measurements of distributed simulation strategies," inProc. 1988 SCS Multiconf. Distributed Simulation, 1988, pp. 14-20.
[4] D.R. Jefferson et al., "Distributed Simulation and the Time Warp Operating Sys tem,"ACM Operating Systems Review, Vol. 21, No. 5, Nov. 1987, pp. 77-93.
[5] L. Kleinrock,Queueing Systems: Vol. 2 - Computer Applications.New York: Wiley, 1976.
[6] Y.-B. Lin, E. D. Lazowska, and J.-L. Baer, "Conservative parallel simulation for systems with no lookahead," inProc. 1990 SCS Multiconf. Distributed Simulation, Jan. 1990, pp. 144-149.
[7] J. Misra, "Distributed discrete-event simulation,"Comput. Surveys, vol. 18, no. 1, Mar. 1986.
[8] D. M. Nicol, "Parallel discrete-event simulation of FCFS stochastic queueing networks," inProc. ACM SIGPLAN Symp. Parallel Programming: Experience with Applications, Languages, and Systems, 1988, pp. 124-137.
[9] D. B. Wagner and E. D. Lazowska, "Parallel simulation of queueing networks: Limitations and potentials," inProc. 1989 ACM SIGMETRICS and Performance '89 Conf., 1989.
[10] D. B. Wagner, E. D. Lazowska, and B. Bershad, "Techniques for efficient shared-memory parallel simulation," inProc. 1989 SCS Multiconf. Distributed Simulation, 1989, pp. 29-37.

Index Terms:
Index Termsparallel simulation; implicit lookahead; stochastic queuing systems; round-robin; lookahead technique; preemptive priority; performance metric; parallel algorithms; performance evaluation; queueing theory; scheduling; stochastic systems
Citation:
Y.B. Lin, E.D. Lazowska, "Exploiting Lookahead in Parallel Simulation," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 4, pp. 457-469, Oct. 1990, doi:10.1109/71.80174
Usage of this product signifies your acceptance of the Terms of Use.