{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:26:41Z","timestamp":1771460801549,"version":"3.50.1"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2005,7]]},"abstract":"<jats:p>\n            This article describes a new priority queue implementation for managing the pending event set in discrete event simulation. Extensive empirical results demonstrate that it consistently outperforms other current popular candidates. This new implementation, called Ladder Queue, is also theoretically justified to have\n            <jats:italic>O<\/jats:italic>\n            (1) amortized access time complexity, as long as the mean\n            <jats:italic>jump<\/jats:italic>\n            parameter of the priority increment distribution is finite and greater than zero, regardless of its variance. Many practical priority increment distributions satisfy this condition including unbounded variance distributions like the Pareto distribution. This renders the LadderQ the ideal discrete event queue structure for stable\n            <jats:italic>O<\/jats:italic>\n            (1) performance even under practical queue distributions with infinite variance. Numerical simulations ranging from 100 to 10 million events affirm the\n            <jats:italic>O<\/jats:italic>\n            (1) property of LadderQ and that it is a superior structure for large-scale discrete event simulation.\n          <\/jats:p>","DOI":"10.1145\/1103323.1103324","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:07:09Z","timestamp":1139238429000},"page":"175-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Ladder queue"],"prefix":"10.1145","volume":"15","author":[{"given":"Wai Teng","family":"Tang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Rick Siow Mong","family":"Goh","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Ian Li-Jin","family":"Thng","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2005,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/63039.63045"},{"key":"e_1_2_1_2_1","first-page":"1332","volume-title":"Proceedings of the 26th Conference on Winter Simulation","author":"Das S."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/361026.361028"},{"key":"e_1_2_1_4_1","unstructured":"Fall K. and Varadhan K. 2002. The NS Manual. UCB\/LBNL\/VINT Network simulator v2. http:\/\/www.isi.edu\/nsnam\/ns\/.  Fall K. and Varadhan K. 2002. The NS Manual. UCB\/LBNL\/VINT Network simulator v2. http:\/\/www.isi.edu\/nsnam\/ns\/."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/5684.5686"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/63039.63042"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/249204.249205"},{"key":"e_1_2_1_9_1","first-page":"303","article-title":"Lazy queue: New approach to implementing the pending event set","volume":"3","author":"R\u00f6nngren R.","year":"1993","journal-title":"Int. J. Comput. Simul."},{"key":"e_1_2_1_10_1","volume-title":"CSIM18 User's Guide. Mesquite Software","author":"Schwetman H."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103323.1103324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1103323.1103324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:25Z","timestamp":1750286605000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103323.1103324"}},"subtitle":["An\n            <i>O<\/i>\n            (1) priority queue structure for large-scale discrete event simulation"],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["10.1145\/1103323.1103324"],"URL":"https:\/\/doi.org\/10.1145\/1103323.1103324","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]},"assertion":[{"value":"2005-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}