Efficient Techniques for Simulating Service Disciplines

Efficient techniques for simulating the Round-Robin and Processor-Sharing service disciplines are presented. These schemes are general in that they can be applied in any discrete-event simulation view to improve execution performance. For the Round-Robin discipline, the proposed approach is based on computation instead of process switching. For the Processor-Sharing discipline, we introduce a lazy approach in combination with any efficient priority queue structure to reduce scheduling-related computation. Using the Si simulation testbed for Simulating (process) interactions, the proposed algorithms are shown to be more efficient than the standard algorithms for simulating these service disciplines. • This research was supported in part by NSF award CCR-9102331, NATO CRG-900108 and the Mathematical Sciences Section of Oak Ridge National Laboratory under contract Contract DE-AC05-840R21400 with Martin Marietta Energy Systems, Inc.

[1]  William R. Franta,et al.  The process view of simulation , 1977 .

[2]  Herb Schwetman,et al.  CSIM: a C-based process-oriented simulation language , 1986, WSC '86.

[3]  Daniel E. House A note on two simulation benchmarks , 1989, SIML.

[4]  Vernon J. Rego A Note on Two Simulation Benchmarks , 1988 .

[5]  Albert G. Greenberg,et al.  Unboundedly parallel simulations via recurrence relations , 1990, SIGMETRICS '90.

[6]  Herb Schwetman Hybrid simulation models of computer systems , 1978, CACM.

[7]  Asser N. Tantawi,et al.  Performance Analysis of Parallel Processing Systems , 1988, IEEE Trans. Software Eng..

[8]  Terry Williams,et al.  Probability and Statistics with Reliability, Queueing and Computer Science Applications , 1983 .

[9]  O. J. Dahl,et al.  Simula Begin , 1979 .

[10]  M. H. MacDougall Computer System Simulation: An Introduction , 1970, CSUR.

[11]  Kishor S. Trivedi Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[13]  Herb Schwetman,et al.  Using CSIM to model complex systems , 1988, 1988 Winter Simulation Conference Proceedings.

[14]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[15]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[16]  M. H. MacDougall Simulating computer systems: techniques and tools , 1989 .

[17]  A. Alan B. Pritsker,et al.  Introduction to simulation and SLAM II , 1979 .

[18]  Randy Brown,et al.  Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem , 1988, CACM.