Mlist : an Efficient Pending Event Set Structure for Discrete Event Simulation

@inproceedings{Goh2004MlistA,
  title={Mlist : an Efficient Pending Event Set Structure for Discrete Event Simulation},
  author={Rick Siow Mong Goh and Ian Li-Jin Thng},
  year={2004}
}
In discrete event simulation (DES), the priority queue structure for managing the pending event set (PES) of the DES is known to account for as much as 40% of the simulation execution time. The priority queue contains events where the minimum time-stamp event has the highest priority and the maximum time-stamp event has the lowest priority. Current expected O(1) amortized time complexity priority queues are the Calendar Queue (CQ), Dynamic CQ, SNOOPy CQ, the 2-tier Dynamic Lazy CQ, as well as… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
17 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Dynamic Lazy Calendar Queue: An Event List for Network Simulation

  • S. Oh, J. Ahn
  • In Proceedings of HPC Asia
  • 1997
Highly Influential
4 Excerpts

Dynamic multipath routing and how it compares with other dynamic routing algorithms for high speed wide area network

  • S. Bahk, E ZarkiM.
  • In Proceedings of ACM SIGCOMM ’92 on…
  • 1992

Performance evaluation and design of multiservice networks

  • J. W. Roberts
  • Commission of the European Communities,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…