{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:38:21Z","timestamp":1775000301026,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T00:00:00Z","timestamp":1698278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["DMS-1854562, DMS-1854659"],"award-info":[{"award-number":["DMS-1854562, DMS-1854659"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2023,10,31]]},"abstract":"<jats:p>In this article, we focus on ranking and selection procedures that sequentially allocate replications to systems by applying some acquisition function. We propose an acquisition function, called gCEI, which exploits the gradient of the complete expected improvement with respect to the number of replications. We prove that the gCEI procedure, which adopts gCEI as the acquisition function in a serial computing environment, achieves the asymptotically optimal static replication allocation of Glynn and Juneja in the limit under a normality assumption. We also propose two procedures, called caching and credit, that extend any acquisition-function-based procedure in a serial environment into both synchronous and asynchronous parallel environments. While allocating replications to systems, both procedures use persistence forecasts for the unavailable outputs of the currently running replications, but differ in usage of the available outputs. We prove that, under certain assumptions, the caching procedure achieves the same asymptotic allocation as in the serial environment. A similar result holds for the credit procedure using gCEI as the acquisition function. In terms of efficiency and effectiveness, the credit procedure empirically performs as well as the caching procedure, despite not carefully controlling the output history as the caching procedure does, and is faster than the serial version without any number-of-replications penalty due to using persistence forecasts. Both procedures are designed to solve small-to-medium-sized problems on computers with a modest number of processors, such as laptops and desktops as opposed to high-performance clusters, and are superior to state-of-the-art parallel procedures in this setting.<\/jats:p>","DOI":"10.1145\/3618299","type":"journal-article","created":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T12:24:07Z","timestamp":1693830247000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Using Cache or Credit for Parallel Ranking and Selection"],"prefix":"10.1145","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3973-6456","authenticated-orcid":false,"given":"Harun","family":"Avci","sequence":"first","affiliation":[{"name":"Northwestern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1325-2624","authenticated-orcid":false,"given":"Barry L.","family":"Nelson","sequence":"additional","affiliation":[{"name":"Northwestern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5171-0614","authenticated-orcid":false,"given":"Eunhye","family":"Song","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3278-5637","authenticated-orcid":false,"given":"Andreas","family":"W\u00e4chter","sequence":"additional","affiliation":[{"name":"Northwestern University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,10,26]]},"reference":[{"key":"e_1_3_2_2_1","volume-title":"Proceedings of the Winter Simulation Conference","author":"Avci Harun","year":"2021","unstructured":"Harun Avci, Barry L. Nelson, and Andreas W\u00e4chter. 2021. Getting to \u201cRate-optimal\u201d in ranking & selection. In Proceedings of the Winter Simulation Conference. Retrieved from https:\/\/www.informs--sim.org\/wsc21papers\/236.pdf"},{"key":"e_1_3_2_3_1","first-page":"708","volume-title":"Proceedings of the Winter Simulation Conference","author":"Branke J\u00fcrgen","year":"2005","unstructured":"J\u00fcrgen Branke, Stephen E. Chick, and Christian Schmidt. 2005. New developments in ranking and selection: An empirical comparison of the three main approaches. In Proceedings of the Winter Simulation Conference. 708\u2013717."},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1070.0721"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008349927281"},{"key":"e_1_3_2_6_1","first-page":"723","volume-title":"Proceedings of the Winter Simulation Conference","author":"Chen E. Jack","year":"2005","unstructured":"E. Jack Chen. 2005. Using parallel and distributed computing to increase the capability of selection procedures. In Proceedings of the Winter Simulation Conference. 723\u2013731."},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/apr.2019.9"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/070693424"},{"key":"e_1_3_2_9_1","volume-title":"Proceedings of the International Conference on Non-Convex Programming","author":"Ginsbourger David","year":"2007","unstructured":"David Ginsbourger, Rodolphe Le Riche, and Laurent Carraro. 2007. A multi-points criterion for deterministic parallel global optimization based on Kriging. In Proceedings of the International Conference on Non-Convex Programming."},{"key":"e_1_3_2_10_1","first-page":"577","volume-title":"Proceedings of the Winter Simulation Conference","author":"Glynn Peter","year":"2004","unstructured":"Peter Glynn and Sandeep Juneja. 2004. A large deviations perspective on ordinal optimization. In Proceedings of the Winter Simulation Conference. 577\u2013585."},{"key":"e_1_3_2_11_1","first-page":"177","volume-title":"Proceedings of the Winter Simulation Conference","author":"Goldsman David","year":"1991","unstructured":"David Goldsman, Barry L. Nelson, and Bruce Schmeiser. 1991. Methods for selecting the best system. In Proceedings of the Winter Simulation Conference. 177\u2013186."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42524-021-0152-6"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64182-9_12"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/02664763.2017.1390555"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/502109.502111"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3215594.3215607"},{"key":"e_1_3_2_19_1","first-page":"1785","volume-title":"Proceedings of the Winter Simulation Conference","volume":"2","author":"Luo Yuh-Chuyn","year":"2000","unstructured":"Yuh-Chuyn Luo, Chun-Hung Chen, E. Y\u00fccesan, and Insup Lee. 2000. Distributed web-based simulation optimization. In Proceedings of the Winter Simulation Conference, Vol. 2. 1785\u20131793."},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122012.1122015"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1577"},{"key":"e_1_3_2_22_1","first-page":"2201","volume-title":"Proceedings of the Winter Simulation Conference","author":"Pei Linda","year":"2018","unstructured":"Linda Pei, Barry L. Nelson, and Susan R. Hunter. 2018. A new framework for parallel ranking & selection using an adaptive standard. In Proceedings of the Winter Simulation Conference. 2201\u20132212."},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3466184.3466525"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2343"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2592378"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1911"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1778"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/3586210.3586476"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1962.tb02419.x"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1177\/0037549709106340"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0928-4869(01)00037-4"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2065"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618299","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:46Z","timestamp":1750291426000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,26]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10,31]]}},"alternative-id":["10.1145\/3618299"],"URL":"https:\/\/doi.org\/10.1145\/3618299","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"value":"1049-3301","type":"print"},{"value":"1558-1195","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,26]]},"assertion":[{"value":"2022-12-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-29","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}