{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T07:30:09Z","timestamp":1697959809675},"reference-count":14,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":8156,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1984,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A package implemented using standard Pascal is described. It provides the user with basic tools for discrete event\u2010orientated simulation, and includes facilities for scheduling and causing pending events, handling of LIFO and FIFO queues, control of periodical dumping of statistics and comprehensive initialization and error routines.<\/jats:p><jats:p>Two versions of the package have been implemented, using tree and linked list structures for scheduled events. Their relative performances are compared. The tree structure proves to be more efficient except in the minority of cases where the set of scheduled events has to be searched frequently; it also provides a much more efficient scheduling algorithm than does a linked list structure.<\/jats:p><jats:p>This package is primarily intended as a communication network design tool, and a simple example of this type of usage is included. It could also be used in undergraduate teaching. Coding examples are given for the main procedures, in the two implementations.<\/jats:p>","DOI":"10.1002\/spe.4380140704","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T03:27:15Z","timestamp":1163820435000},"page":"659-684","source":"Crossref","is-referenced-by-count":4,"title":["A standard Pascal event simulation package"],"prefix":"10.1002","volume":"14","author":[{"given":"B. W.","family":"Marsden","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380080308"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380060307"},{"key":"e_1_2_1_4_2","unstructured":"W. M.McCormack \u2018Analysis of future event set algorithms for discrete event simulation\u2019 Ph. D. Thesis Syracus University Syracus NY 1979."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/358800.358805"},{"key":"e_1_2_1_6_2","volume-title":"Simscript 11.5 Programming Language","author":"Kiviat P. J.","year":"1973"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/360715.360758"},{"key":"e_1_2_1_8_2","unstructured":"J. O.Henriksen \u2018An improved event list algorithm\u2019 Proc. Winter Sim. Conf. Gaithersburg MD 554\u2013557(1977)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/358800.358803"},{"key":"e_1_2_1_10_2","volume-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/25.1.158"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90068-1"},{"issue":"4","key":"e_1_2_1_13_2","first-page":"151","article-title":"The height of binary search trees","volume":"11","author":"Robson J. M.","year":"1979","journal-title":"Aust. Comp. J."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/390017.808309"},{"key":"e_1_2_1_15_2","unstructured":"\u2018Network Independent Transport Service\u2019 Post Office PSS User Forum Study Group 3 February1980"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380140704","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380140704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T01:13:21Z","timestamp":1697764401000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380140704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,7]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1984,7]]}},"alternative-id":["10.1002\/spe.4380140704"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380140704","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,7]]}}}