| |||||||||||||
Improving ticket spinlocksImproving ticket spinlocksPosted Jan 5, 2013 3:27 UTC (Sat) by spigot (subscriber, #50709)In reply to: Improving ticket spinlocks by jdike Parent article: Improving ticket spinlocks It sounds like you're describing the secretary problem. The idea is that you have n applicants for a job, each of whom has a rank from 1 (most qualified) to n (least qualified). You get to interview them in a random order, and after each interview you must decide, on the spot, whether to hire them or reject them. You would like a procedure to maximize your chances of hiring the most qualified candidate. It turns out that you should reject the first n/e candidates, then hire the first of the remainder who is more qualified than any of the rejects (or hiring the last, if none are more qualified). However, it's not obvious to me that this is applicable to the problem at hand.
(Log in to post comments)
|
|||||||||||||