Efficient ranking and selection in parallel computing environments. Ni, E. C., Ciocan, D. F., Henderson, S. G., & Hunter, S. R. Operations Research, 65(3):821–836, May-June, 2017. Algorithm implemented in Simio Portal Edition (2017) and in Simio (2019).
Efficient ranking and selection in parallel computing environments [link]Paper  doi  abstract   bibtex   
The goal of ranking and selection (R&S) procedures is to identify the best stochastic system from among a finite set of competing alternatives. Such procedures require constructing estimates of each system's performance, which can be obtained simultaneously by running multiple independent replications on a parallel computing platform. However, nontrivial statistical and implementation issues arise when designing R&S procedures for a parallel computing environment. Thus we propose several design principles for parallel R&S procedures that preserve statistical validity and maximize core utilization, especially when large numbers of alternatives or cores are involved. These principles are followed closely by our parallel Good Selection Procedure (GSP), which, under the assumption of normally distributed output, (i) guarantees to select a system in the indifference zone with high probability, (ii) runs efficiently on up to 1,024 parallel cores, and (iii) in an example uses smaller sample sizes compared to existing parallel procedures, particularly for large problems (over one million alternatives). In our computational study we discuss two methods for implementing GSP on parallel computers, namely the Message-Passing Interface (MPI) and Hadoop MapReduce and show that the latter provides good protection against core failures at the expense of a significant drop in utilization due to periodic unavoidable synchronization.
@article{2017nicioetal,
	Year = {2017},
	Author = {E. C. Ni and D. F. Ciocan and S. G. Henderson and S. R. Hunter},
	Title = {Efficient ranking and selection in parallel computing environments},
	Journal = {Operations Research},
	volume = {65},
	number = {3},
	month = {May-June},
	pages = {821--836},
	doi = {10.1287/opre.2016.1577},
	url_Paper = {https://arxiv.org/abs/1506.04986},
	abstract = {The goal of ranking and selection (R\&S) procedures is to identify the best stochastic system from among a finite set of competing alternatives. Such procedures require constructing estimates of each system's performance, which can be obtained simultaneously by running multiple independent replications on a parallel computing platform. However, nontrivial statistical and implementation issues arise when designing R&S procedures for a  parallel computing environment. Thus we propose several design principles for parallel R&S procedures that preserve statistical validity and maximize core utilization, especially when large numbers of alternatives or cores are involved. These principles are followed closely by our parallel Good Selection Procedure (GSP), which, under the assumption of normally distributed output,  (i) guarantees to select a system in the indifference zone with high probability, (ii) runs efficiently on up to 1,024 parallel cores, and (iii) in an example uses smaller sample sizes compared to existing parallel procedures, particularly for large problems (over one million alternatives). In our computational study we discuss two methods for implementing GSP on parallel computers, namely the Message-Passing Interface (MPI) and Hadoop MapReduce and show that the latter provides good protection against core failures at the expense of a significant drop in utilization due to periodic unavoidable synchronization.},
	keywords = {simulation optimization: single-objective: ranking and selection: parallel},
	bibbase_note = {<span style="color: green">Algorithm implemented in Simio Portal Edition (2017) and in Simio (2019).</span>}}
Downloads: 0