关键词: 资源调度, 资源预留, 资源抢占, 动态副本创建, MapReduce

Abstract: On a special data-intensive application scenario, users have obvious priority. Based on resource reserve and resource preemption, this paper proposes a scheduling algorithm on user level. This algorithm can improve resource utilization rate, quickly respond to high-priority users’ request, reduce resource preemption cost, and avoid the job with lower priority never being dealt with. Based on dynamic replica creation, this paper proposes another scheduling algorithm on task level. This algorithm can realize data performing locally, slove the load balancing in data access, reduce the response time of job execution.

Key words: resource scheduling, resource reserve, resource preemption, dynamic replica creation, MapReduce