Load Balancing with Two Choices - Quant Trader Interview Question
Difficulty: Hard
Category: Probability & Statistics
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: probability, load-balancing, algorithms, asymptotic-analysis
Problem Description
You are designing a distributed system for processing incoming requests. You have $n$ servers (bins) and $n$ requests (balls). Each request is assigned to a server using a load balancing strategy.
Strategy 1: For each request, you randomly select one server and assign the request to it. It is known that the maximum load (number of requests assigned to any server) is $O(\frac{\log n}{\log \log n})$.
Strategy 2: For each request, you randomly select two servers independently and assign the request
Practice this hard trader interview question on MyntBit - the all-in-one quant learning platform with 200+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.