Write a program to compare the performance of the following...

Write a program to compare the performance of the following variation of the standard balls-and-bins paradigm and the balanced allocation paradigm. Initially $n$ points are placed uniformly at random on the boundary of a circle of circumference 1. These $n$ points divide the circle into $n$ arcs, which correspond to bins. We now place $n$ balls into the bins as follows: each ball chooses $d$ points on the boundary of the circle, uniformly at random. These $d$ points correspond to the arcs (or, equivalently, bins) that they lie on. The ball is placed in the least loaded of the $d$ bins, breaking ties in favor of the smallest arc. Run simulations placing $n$ balls into $n$ bins for the cases $d=1$ and $d=2$. You should try $n=1,000, n=10,000$, and $n=100,000$. Repeat each experiment at least 100 times; for each run, the $n$ initial points should be re-chosen. Give a chart showing the number of times the maximum load was $k$, based on your trials for each value of $d$. You may note that some arcs are much larger than others, and therefore when $d \ddot$ 1 the maximum load can be rather high. Also, to find which bin each ball is placed in may require implementing a binary search or some other additional data structure to quickly map points on the circle boundary to the appropriate bin.

Write a program to compare the performance of the following variation of the standard balls-and-bins paradigm and the balanced allocation paradigm. Initially $n$ points are placed uniformly at random on the boundary of a circle of circumference 1. These $n$ points divide the circle into $n$ arcs, which correspond to bins. We now place $n$ balls into the bins as follows: each ball chooses $d$ points on the boundary of the circle, uniformly at random. These $d$ points correspond to the arcs (or, equivalently, bins) that they lie on. The ball is placed in the least loaded of the $d$ bins, breaking ties in favor of the smallest arc.
Run simulations placing $n$ balls into $n$ bins for the cases $d=1$ and $d=2$. You should try $n=1,000, n=10,000$, and $n=100,000$. Repeat each experiment at least 100 times; for each run, the $n$ initial points should be re-chosen. Give a chart showing the number of times the maximum load was $k$, based on your trials for each value of $d$.
You may note that some arcs are much larger than others, and therefore when $d \ddot$ 1 the maximum load can be rather high. Also, to find which bin each ball is placed in may require implementing a binary search or some other additional data structure to quickly map points on the circle boundary to the appropriate bin.

Key Concepts

Balls_and_Bins_Model

This model is a fundamental abstraction in probability and computer science where a number of balls are randomly distributed into a number of bins. It is used to analyze load balancing, resource allocation, and various aspects of randomized algorithms. In its basic form, each ball is placed into a bin independently at random, leading to uneven load distributions and potential congestion in some bins.

Balanced_Allocation

The balanced allocation paradigm, sometimes known as the 'power of two choices' technique, improves on the standard balls-and-bins model by allowing each ball a choice among multiple bins (d choices) before being placed in the one with the lowest load. This method greatly reduces the maximum load across bins and provides a more balanced distribution, which is critical in efficient resource management and load balancing scenarios.

Uniform_Random_Distribution

Uniform random distribution is the principle that every point or bin is equally likely to be chosen when placing a ball. This concept is essential for ensuring that the random allocation is fair and unbiased, which forms the basis for many probabilistic models and simulations in computer science and mathematics.

Maximum_Load_Analysis

Analyzing the maximum load refers to examining the heaviest loaded bin after all allocations are made. This analysis is crucial to understand the worst-case scenario in load balancing tasks and to evaluate the effectiveness of different allocation strategies, particularly in identifying cases where one bin might become a bottleneck due to high load.

Simulation_and_Empirical_Analysis

Simulation involves running repeated randomized experiments to model complex systems and gather statistical data about their behavior. In this context, simulations are used to estimate the distribution of loads across bins under different allocation strategies (varying the choices d) and to compare their performance. Empirical analysis through repeated trials helps in understanding the probabilistic behavior and verifying theoretical predictions.

Efficient_Search_Data_Structures

When mapping randomly chosen points to the corresponding bins, especially under non-uniform or spatial conditions, efficient data structures such as binary search implementations become critical. These structures enable rapid look-up and assignment, ensuring that each ball is placed in the correct bin quickly, which is essential for scalability in simulation experiments.

Transcript

00:01 Hello, for problem 19, you're asked to write a program that replicates the bean machine game.

00:10 So we're going to start by asking a user to enter a number of balls to drop, as well as a number of slots in the bean machine.

00:19 We'll call the number of balls balls and the number of slots slots.

00:23 I'm going to be using random to determine the path that the ball takes.

00:28 So i'm going to import random next.

00:31 And before i move on, i'll point out that there are lots of different ways of writing this.

00:36 So this is the way that i chose to write this program to recreate the bean machine, but there are other ways to do it.

00:45 But yes, so i imported random and now i am setting direction equal to the string lr.

00:52 The length of the boards, so the length of the path that the ball has to take will be equal to the number of slots.

01:01 And i'm going to additionally create a list called slots that is equal to the number of slots and starts out being filled with zeros.

01:13 So zero times slots.

01:16 Now for each ball, we need to determine its path.

01:19 So for ball in range balls, i'm going to set the path equal to an empty list.

01:26 And so for i in range length, where again length is length of the path, we want to append to our path list random dot choice direction.

01:37 So for each step in the path length, we want to randomly choose left or right and append that to the path.

01:45 Then we'll print out the path.

01:49 I've chosen to print using the join function so that it prints it without the brackets and commas and everything and it just prints out the letters...

Please give Ace some feedback