Google llc (20240118920). WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES simplified abstract

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 20240118920 titled 'WORKLOAD SCHEDULING USING QUEUES WITH DIFFERENT PRIORITIES

Simplified Explanation

The patent application describes methods, systems, and apparatus 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, while the low priority queue maintains pending low priority workloads to be scheduled for execution. The computing system schedules the pending low priority workloads for execution by utilizing computing resources provided by the system only when the high priority queue is empty.

  • High priority queue and low priority queue for scheduling workloads on computing resources
  • Utilization of computing resources only when high priority queue is empty

Potential Applications

This technology could be applied in cloud computing environments, data centers, and distributed computing systems to efficiently manage and prioritize workloads based on their priority levels.

Problems Solved

1. Efficiently managing and prioritizing workloads on computing resources 2. Ensuring that high priority workloads are executed promptly while utilizing resources effectively

Benefits

1. Improved performance and responsiveness in executing high priority workloads 2. Optimal utilization of computing resources 3. Enhanced workload management and scheduling capabilities

Potential Commercial Applications

Optimizing workload scheduling in cloud computing services for improved customer satisfaction and resource utilization.

Possible Prior Art

There may be prior art related to workload scheduling algorithms and systems used in cloud computing and distributed computing environments.

Unanswered Questions

How does this technology impact energy efficiency in computing systems?

This article does not address the specific impact of this technology on energy efficiency in computing systems. It would be interesting to explore how the optimized workload scheduling could potentially lead to energy savings.

What are the potential security implications of using high and low priority queues in workload scheduling?

The article does not delve into the security aspects of implementing high and low priority queues for workload scheduling. It would be important to consider how this system could affect security measures and potential vulnerabilities in the computing environment.


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.