Scheduler P/F Request Resource Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In complex large-scale computing environments, effective management and allocation of resources are hindered by limitations in availability and reliability, as well as challenges in system maintenance and upgrades, particularly in specifying desired performance and reliability levels in resource allocation.
Innovation Solution
A method is introduced where a scheduler in a computing environment receives performance and failure (p/f) requests that specify desired behavior among groups of tasks, determining available resources to allocate and fulfill these requests, with options for hard or soft constraints based on performance and availability metrics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing constraint specifications are used (task X needs resource Y), then resource allocation is simplified, but desired performance and reliability levels cannot be specified
Solution Approach 1:
The patent transforms the constraint specification from simple resource assignment to a multi-parameter framework that includes performance levels, reliability requirements, and behavioral relationships. This allows users to specify not just which resources are needed, but also the desired performance and reliability levels, directly addressing the limitation of existing systems
2Productivity
If resources are allocated to meet performance requirements, then performance is improved, but resource availability may be compromised
Solution Approach 1:
The patent implements dynamic resource allocation where the scheduler continuously monitors and adjusts resource assignment based on changing performance requirements and availability conditions. The system can adaptively reallocate resources to maintain both performance and availability, rather than using static allocation that sacrifices one for the other
Solution Approach 2:
The system allows for soft constraints where resources can be partially allocated or over-allocated based on current conditions. This enables the system to meet performance requirements when resources are available while maintaining availability as a secondary consideration, rather than rigidly enforcing one or the other
3Manufacturing precision
If hard constraints are enforced for performance relationships, then performance requirements are guaranteed, but resource allocation flexibility is reduced
Solution Approach 1:
The patent enables dynamic switching between hard and soft constraint enforcement based on system conditions and user preferences. The scheduler can adjust the strictness of constraint satisfaction to balance between guaranteeing performance requirements and maintaining allocation flexibility, allowing adaptation to different operational scenarios
Data Source
AI summary
A method of specifying behavior among a group of computing tasks included in a request to be performed in a domain of computing resources is disclosed. Method steps include receiving, at a scheduler operably coupled to the domain, a p/f request, the received p/f request including a first group and a first relationship, the first group comprising at least a first p/f group element and a second p/f group element, the first relationship defining a desired behavior of the first and second p/f group elements with respect to each other during performance of the p/f request; determining whether the domain includes available computing resources capable of satisfying the first relationship; and in response to a determination that the domain includes available computing resources capable of satisfying the first relationship, allocating, with the scheduler, at least one available computing resource to fulfill the p/f request.