17963897. WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES (Google LLC)
WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES
Organization Name
Inventor(s)
Thomas Benjamin Jablin of Saratoga CA US
Caitlin King Stanton of San Francisco CA US
WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES
This abstract first appeared for US patent application 17963897 titled 'WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES
Original Abstract Submitted
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling workloads on computing resources using a high priority queue and a low priority queue. The high priority queue maintains pending high priority workloads to be scheduled for execution, and the low priority queue maintains pending low priority workloads to be scheduled for execution. The computing system as described in this specification schedules the pending low priority workloads for execution by utilizing computing resources provided by the system only when the high priority queue is empty.
