HIGHLY SCALABLE SLA-AWARE SCHEDULING FOR CLOUD SERVICES
First Claim
1. A method, comprising:
- a. map each job, based on an arrival time and SLA function, to a fixed point in a dual space of linear functions;
b. at the time of selecting the next job with the highest priority to execute, a line with a predetermined angle in the query space is used to locate the current job with the highest CBS score; and
c. incrementally maintain the job with the highest CBS score over time using a dynamic convex hull.
1 Assignment
0 Petitions
Accused Products
Abstract
An efficient cost-based scheduling method called incremental cost-based scheduling, iCBS, maps each job, based on its arrival time and SLA function, to a fixed point in the dual space of linear functions. Due to this mapping, in the dual space, the job will not change their locations over time. Instead, at the time of selecting the next job with the highest priority to execute, a line with appropriate angle in the query space is used to locate the current job with the highest CBS score in logarithmic time. Because only those points that are located on the convex hull in the dual space can be chosen, a dynamic convex hull maintaining method incrementally maintains the job with the highest CBS score over time.
48 Citations
11 Claims
-
1. A method, comprising:
-
a. map each job, based on an arrival time and SLA function, to a fixed point in a dual space of linear functions; b. at the time of selecting the next job with the highest priority to execute, a line with a predetermined angle in the query space is used to locate the current job with the highest CBS score; and c. incrementally maintain the job with the highest CBS score over time using a dynamic convex hull. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification