EconPapers    
Economics at your fingertips  
 

Efficient Ranking and Selection in Parallel Computing Environments

Eric C. Ni (), Dragos F. Ciocan (), Shane G. Henderson () and Susan R. Hunter ()
Additional contact information
Eric C. Ni: School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853
Dragos F. Ciocan: Technology and Operations Management, INSEAD, Fontainebleau, France 77300
Shane G. Henderson: School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853
Susan R. Hunter: School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907

Operations Research, 2017, vol. 65, issue 3, 821-836

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. Nontrivial statistical and implementation issues arise when designing R&S procedures for a parallel computing environment. 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) in tests on up to 1,024 parallel cores runs efficiently, and (iii) in an example uses smaller sample sizes compared to existing parallel procedures, particularly for large problems (over 10 6 alternatives). In our computational study we discuss three methods for implementing GSP on parallel computers, namely the Message-Passing Interface (MPI), Hadoop MapReduce, and Spark, and show that Spark provides a good compromise between the efficiency of MPI and robustness to core failures.

Keywords: ranking and selection; parallel computing (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
https://doi.org/10.1287/opre.2016.1577 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:65:y:2017:i:3:p:821-836

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:oropre:v:65:y:2017:i:3:p:821-836