Scheduling Mapreduce Jobs in the Presence of Priority Classes
First Claim
Patent Images
1. A method for scheduling one or more MapReduce jobs in a presence of one or more priority classes, wherein the method comprises:
- obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes;
prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class; and
iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs.
1 Assignment
0 Petitions
Accused Products
Abstract
Techniques for scheduling one or more MapReduce jobs in a presence of one or more priority classes are provided. The techniques include obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes, prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class, and iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs.
-
Citations
25 Claims
-
1. A method for scheduling one or more MapReduce jobs in a presence of one or more priority classes, wherein the method comprises:
-
obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes; prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class; and iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A computer program product comprising a tangible computer readable recordable storage medium including computer useable program code for scheduling one or more MapReduce jobs in a presence of one or more priority classes, the computer program product including:
-
computer useable program code for obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes; computer useable program code for prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class; and computer useable program code for iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs. - View Dependent Claims (14, 15, 16, 17, 18)
-
-
19. A system for scheduling one or more MapReduce jobs in a presence of one or more priority classes, comprising:
-
a memory; and at least one processor coupled to the memory and operative to; obtain a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes; prioritize the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class; and iteratively employ a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs. - View Dependent Claims (20, 21, 22, 23, 24, 25)
-
Specification