{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:31Z","timestamp":1750307131098,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T00:00:00Z","timestamp":1316044800000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2011,9,15]]},"DOI":"10.1145\/2034832.2034854","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T13:48:54Z","timestamp":1316526534000},"page":"70-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Poster"],"prefix":"10.1145","volume":"39","author":[{"given":"Joost","family":"Bosman","sequence":"first","affiliation":[{"name":"CWI, Probability and Stochastic Networks, Amsterdam, The Netherlands and VU University Amsterdam, Department of Mathematics, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"van der Mei","sequence":"additional","affiliation":[{"name":"CWI, Probability and Stochastic Networks, Amsterdam, The Netherlands and VU University Amsterdam, Department of Mathematics, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard","family":"Hoekstra","sequence":"additional","affiliation":[{"name":"CWI, Probability and Stochastic Networks, Amsterdam, The Netherlands and Innovation Research &amp; Technology, Thales Nederland B.V., Huizen, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,9,15]]},"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034832.2034854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2034832.2034854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:39Z","timestamp":1750240119000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2034832.2034854"}},"subtitle":["optimal dispatching policies for parallel processor sharing nodes with partial information"],"short-title":[],"issued":{"date-parts":[[2011,9,15]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,9,15]]}},"alternative-id":["10.1145\/2034832.2034854"],"URL":"https:\/\/doi.org\/10.1145\/2034832.2034854","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2011,9,15]]},"assertion":[{"value":"2011-09-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}