17963897. WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES simplified abstract (GOOGLE LLC)

From WikiPatents
Jump to navigation Jump to search

WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES

Organization Name

GOOGLE LLC

Inventor(s)

Yu Wang of San Jose CA (US)

Thomas Benjamin Jablin of Saratoga CA (US)

Caitlin King Stanton of San Francisco CA (US)

WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES - A simplified explanation of the abstract

This abstract first appeared for US patent application 17963897 titled 'WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES

Simplified Explanation

The patent application describes a method for scheduling workloads on computing resources using a high priority queue and a low priority queue. The high priority queue holds pending high priority workloads, while the low priority queue holds pending low priority workloads. The system schedules the low priority workloads for execution only when the high priority queue is empty.

  • High priority queue for pending high priority workloads
  • Low priority queue for pending low priority workloads
  • Scheduling of low priority workloads only when high priority queue is empty

Potential Applications

This technology could be applied in cloud computing environments, data centers, and any system where workload scheduling is crucial for efficient resource utilization.

Problems Solved

1. Efficient workload scheduling on computing resources 2. Prioritization of high priority tasks over low priority tasks

Benefits

1. Improved resource utilization 2. Enhanced system performance 3. Prioritization of critical tasks

Potential Commercial Applications

Optimizing resource allocation in cloud computing services

Possible Prior Art

There are existing systems for workload scheduling based on priority levels, but the specific implementation described in this patent application may be novel.

Unanswered Questions

How does the system determine the priority level of incoming workloads?

The abstract does not provide details on how the system assigns priority levels to incoming workloads.

What happens if a high priority workload arrives while low priority workloads are being executed?

It is unclear from the abstract how the system handles the arrival of high priority workloads during the execution of low priority tasks.


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.