{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T08:40:30Z","timestamp":1733388030475,"version":"3.30.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-5316(00)00007-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:36:16Z","timestamp":1027629376000},"page":"149-164","source":"Crossref","is-referenced-by-count":2,"title":["Parallel simulation of ATM switches using relaxation"],"prefix":"10.1016","volume":"41","author":[{"given":"A.S","family":"McGough","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I","family":"Mitrani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-5316(00)00007-9_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/128738.128739","article-title":"Algorithms for unboundedly parallel simulations","volume":"9","author":"Greenberg","year":"1991","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0166-5316(00)00007-9_BIB2","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging and sorting in parallel computation","volume":"TC-32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-5316(00)00007-9_BIB3","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"TC-34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-5316(00)00007-9_BIB4","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/71.224220","article-title":"Balanced parallel sort on hypercube multiprocessors","volume":"4","author":"Abali","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0166-5316(00)00007-9_BIB5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1019149712019","article-title":"Parallel simulation by multi-instruction, longest-path algorithms","volume":"27","author":"Chen","year":"1997","journal-title":"Queueing Systems"},{"key":"10.1016\/S0166-5316(00)00007-9_BIB6","doi-asserted-by":"crossref","unstructured":"K.M. Chandy, R. Sherman, Space\u2013time and simulation, in: Distributed Simulation 1989, Society for Computer Simulation, 1989, pp. 53\u201357.","DOI":"10.1177\/003754978905300204"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531600000079?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531600000079?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T08:01:41Z","timestamp":1733385701000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531600000079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166531600000079"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(00)00007-9","relation":{},"ISSN":["0166-5316"],"issn-type":[{"type":"print","value":"0166-5316"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}