Job scheduling based on historical job data
US-2015199218-A1 · Jul 16, 2015 · US
US2018165123A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2018165123-A1 |
| Application number | US-201615376768-A |
| Country | US |
| Kind code | A1 |
| Filing date | Dec 13, 2016 |
| Priority date | Dec 13, 2016 |
| Publication date | Jun 14, 2018 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A device and a method for job scheduling at a signal processing component with limited queue availability, in response to a request for one or more new jobs, the method comprising: calculating a metric for each job in the queue and a request metric for the one or more new jobs, wherein each job's metric is based on a difference between an estimate output of executing the job in current conditions and a previous output of the job; determining a minimum metric from the metrics calculated for the jobs in the queue; and comparing the minimum metric to the request metrics to determine whether to schedule to new job for execution.
Opening claim text (preview).
What is claimed is: 1 . A circuitry configured to schedule execution of jobs at a signal processing component of a device in response to a request for a new job, the circuitry comprising: a computing circuit configured to compute a metric for each of a plurality of jobs in a queue waiting to be processed and a request metric for the new job, wherein each metric is based on a difference in expected output of executing a respective job in current conditions compared to the respective job's output from a previous execution; a determiner configured to determine a minimum metric from the metrics calculated for each of the plurality of jobs in the queue; and a comparison circuit configured to compare the minimum metric to the request metric. 2 . The circuitry of claim 1 , wherein where the request metric is greater than the minimum metric, the comparison circuit further configured to reallocate a position in the queue to the job associated with the request metric and discard the job associated with the minimum metric. 3 . The circuitry of claim 1 , wherein where the minimum metric is greater than or equal to the request metric, the comparison circuit further configured to discard the new job. 4 . The circuitry of claim 1 , the determiner further configured to determine the minimum metric from jobs in the queue which have not commenced execution. 5 . The circuitry of claim 1 , further comprising a sorting circuit configured to sort the jobs in the queue according to their metric. 6 . The circuitry of claim 1 , the computing circuit configured to calculate each metric according to a utility function comprising a plurality of parameters. 7 . The circuitry of claim 6 , wherein the utility function monotonically increases with larger differences between the estimate output and the previous output of the respective job. 8 . The circuitry of claim 6 , wherein the utility function comprises a channel correlation change parameter. 9 . The circuitry of claim 6 , wherein the utility function comprises a signal to noise ratio (SNR) change parameter. 10 . The circuitry of claim 6 , wherein the utility function comprises a Doppler change parameter. 11 . A circuit configured to schedule job execution at a signal processing component in response to one or more requests for new jobs, where the one or more new jobs exceeds a number of available positions in a queue pending execution at the signal processing component, the circuit comprising: a determiner configure to determine a metric for each of the one or more new jobs, wherein each metric of a respective job is based on a difference between an estimate output of executing the respective job in current conditions and a previous output of the respective job; a sorter configured to sort the one or more new jobs and jobs pending execution in the queue according to their metric; and an assignor configured to re-assign positions in the queue to the one or more new jobs and the jobs in the queue according to their metric. 12 . The circuit of claim 11 , the assignor further configured to discard jobs which have not been re-assigned a position in the queue once the positions in the queue have been filled. 13 . The circuit of claim 11 , the determiner further configured to determine a metric for each of the jobs pending execution in the queue. 14 . The circuit of claim 11 , the determiner further configured to determine each job's metric according to a utility function comprising a plurality of parameters. 15 . A method for job scheduling at a signal processing component having a full queue of jobs pending execution, in response to a request for a new job, the method comprising: calculating a metric for each job in the queue and a request metric for the new job, wherein each respective job's metric is based on a difference between an estimate output of executing the respective job in current conditions and a previous output of the respective job; determining a minimum metric from the metrics calculated for the jobs in the queue; and comparing the minimum metric to the request metric. 16 . The method of claim 15 , wherein where the request metric is greater than the minimum metric, discarding the job associated with the minimum metric and reallocating a position in the queue to the new job. 17 . The method of claim 15 , wherein where the minimum metric is greater than or equal to the request metric, discarding the new job. 18 . The method of claim 15 , wherein each job's metric is calculated according to a utility function comprising a plurality of parameters. 19 . The method of claim 18 , wherein the utility function comprises an age change parameter. 20 . The method of claim 18 , wherein the utility function comprises a channel correlation change parameter. 21 . The method of claim 18 , wherein the utility function comprises a signal to noise ratio (SNR) change parameter. 22 . The method of claim 18 , wherein the utility function comprises a Doppler change parameter. 23 . A non-transitory computer readable medium with program instructions which when executed cause a processor of a device to cause the device to perform a job scheduling at a signal processing component having a full queue of jobs pending execution, comprising: calculating a metric for each job in the queue and a request metric for the new job, wherein each respective job's metric is based on a difference between an estimate output of executing the respective job in current conditions and a previous output of the respective job; determining a minimum metric from the metrics calculated for the jobs in the queue; and comparing the minimum metric to the request metric. 24 . The non-transitory computer readable medium of claim 23 , further comprising wherein where the request metric is greater than the minimum metric, discarding the job associated with the minimum metric and reallocating a position in the queue to the new job. 25 . The non-transitory computer readable medium of claim 23 , further comprising wherein where the minimum metric is greater than or equal to the request metric, discarding the new job.
to service a request · CPC title
Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title
Partitioning or combining of resources · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.