官术网_书友最值得收藏!

Job scheduling in YARN

It is not uncommon for large Hadoop clusters to have multiple jobs running concurrently. The allocation of resources when there are multiple jobs submitted from multiple departments becomes an important and indeed interesting topic. Which request should receive priority if say, two departments, A and B, submit a job at the same time but each request is for the maximum available resources? In general, Hadoop uses a First-In-First-Out (FIFO) policy. That is, whoever submits the job first gets to use the resources first. But what if A submitted the job first but completing A's job will take five hours whereas B's job will complete in five minutes?

To deal with these nuances and variables in job scheduling, numerous scheduling methods have been implemented. Three of the more commonly used ones are:

  • FIFO: As described above, FIFO scheduling uses a queue to priorities jobs. Jobs are executed in the order in which they are submitted.
  • CapacityScheduler: CapacityScheduler assigns a value on the number of jobs that can be submitted on a per-department basis, where a department can indicate a logical group of users. This is to ensure that each department or group can have access to the Hadoop cluster and be able to utilize a minimum number of resources. The scheduler also allows departments to scale up beyond their assigned capacity up to a maximum value set on a per-department basis if there are unused resources on the server. The model of CapacityScheduler thus provides a guarantee that each department can access the cluster on a deterministic basis.
  • Fair Schedulers: These schedulers attempt to evenly balance the utilization of resources across different apps. While an even balance might not be feasible at a certain given point in time, balancing allocation over time such that the averages are more or less similar can be achieved using Fair Schedulers.

These, and other schedulers, provide finely grained access controls (such as on a per-user or per-group basis) and primarily utilize queues in order to prioritize and allocate resources.

主站蜘蛛池模板: 贵定县| 霍林郭勒市| 宁乡县| 双峰县| 马边| 资阳市| 满洲里市| 得荣县| 杭锦后旗| 南安市| 犍为县| 罗城| 胶州市| 湘潭县| 南郑县| 阳原县| 无棣县| 大理市| 淳化县| 尉犁县| 博客| 德化县| 织金县| 鹿泉市| 满城县| 闻喜县| 林甸县| 康平县| 宜黄县| 东至县| 白山市| 肃北| 陵川县| 丘北县| 江川县| 响水县| 科尔| 上饶市| 盐池县| 井研县| 北京市|