Fair scheduler

In fair scheduling, all applications get almost an equal amount of the available resources. In fair scheduler, when the first application is submitted to YARN, it will assign all the available resources to the application. Now in any scenario, if the new application is submitted to the scheduler, the scheduler will start allocating resources to the new application until both the applications have almost an equal amount of resources for their execution. Unlike the two schedulers discussed before, the fair scheduler prevents applications from resource starvation and assures that the applications in the queue get the required memory for execution. The distribution of the minimum and maximum share resources are calculated by the scheduling queue by using the configuration provided in the fair scheduler. The application will get the amount of resources configured for the queue where the application is submitted and if a new application is submitted to the same queue, the total...