17957714. HIERARCHICAL WORK SCHEDULING simplified abstract (ADVANCED MICRO DEVICES, INC.)
Contents
HIERARCHICAL WORK SCHEDULING
Organization Name
Inventor(s)
Matthaeus G. Chajdas of Munich (DE)
Christopher J. Brennan of Boxborough MA (US)
Michael Mantor of Orlando FL (US)
Robert W. Martin of Acton MA (US)
Nicolai Haehnle of Munich (DE)
HIERARCHICAL WORK SCHEDULING - A simplified explanation of the abstract
This abstract first appeared for US patent application 17957714 titled 'HIERARCHICAL WORK SCHEDULING
Simplified Explanation
The method described in the abstract involves hierarchical work scheduling, where work items are consumed at a first scheduling domain with a local scheduler circuit and processing elements. The local scheduler circuit distributes new work items within the domain, but may pass on items that would overload the domain to a higher-level scheduler for redistribution.
- Explanation:
- Consuming work items at a first scheduling domain
- Producing new work items
- Distributing new work items locally
- Passing on overloaded work items to higher-level scheduler
- Potential Applications:**
This technology could be applied in various industries where complex work scheduling is required, such as manufacturing, logistics, and data processing.
- Problems Solved:**
This method helps prevent overload in scheduling domains by redistributing work items efficiently, ensuring optimal performance and resource utilization.
- Benefits:**
- Improved workload distribution - Enhanced performance efficiency - Scalability in scheduling domains
- Potential Commercial Applications:**
"Optimized Work Scheduling Technology for Efficient Resource Allocation"
- Possible Prior Art:**
Prior art in this field may include research on workload distribution algorithms and hierarchical scheduling systems.
- Unanswered Questions:**
- 1. How does the local scheduler circuit determine which work items would overload the domain?**
The abstract does not provide specific details on the criteria used by the local scheduler circuit to identify overloaded work items.
- 2. Are there any limitations to the scalability of this hierarchical work scheduling method?**
The abstract does not mention any potential limitations or constraints that may arise when implementing this technology on a larger scale.
Original Abstract Submitted
A method for hierarchical work scheduling includes consuming a work item at a first scheduling domain having a local scheduler circuit and one or more workgroup processing elements. Consuming the work item produces a set of new work items. Subsequently, the local scheduler circuit distributes at least one new work item of the set of new work items to be executed locally at the first scheduling domain. If the local scheduler circuit of the first scheduling domain determines that the set of new work items includes one or more work items that would overload the first scheduling domain with work if scheduled for local execution, those work items are distributed to the next higher-level scheduler circuit in a scheduling domain hierarchy for redistribution to one or more other scheduling domains.
