Processor Scheduling for Real-Time Deadline Compliance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing operating systems face challenges in efficiently scheduling operations between real-time and non-real-time processors, particularly in ensuring deterministic operations meet deadlines without causing delays in hard real-time systems.
Innovation Solution
A method and system that determine the execution duration and latency requirements of operations, routing deterministic operations to appropriate processors to ensure timely completion, and transferring tasks between processors as needed to maintain deadline compliance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If operations are executed on a single processor without differentiation, then device complexity is reduced, but real-time deadline compliance cannot be guaranteed
Solution Approach 1:
The system segments processors into two distinct types: hard real-time processors for deterministic operations with strict deadlines, and non-hard real-time processors for non-deterministic operations. This segmentation allows each processor type to be optimized for its specific workload, ensuring deadline compliance for critical operations while maintaining overall system functionality.
Solution Approach 2:
Different processor types are assigned different operational characteristics and scheduling policies. Hard real-time processors implement deterministic scheduling algorithms that guarantee deadline compliance, while non-hard real-time processors use more flexible scheduling approaches. This local quality differentiation ensures that each processor operates with the appropriate level of determinism for its intended workload.
2Reliability
If deterministic operations are prioritized on hard real-time processors, then deadline compliance is improved, but productivity of non-critical operations may deteriorate
Solution Approach 1:
The system segments operations into deterministic and non-deterministic categories, assigning them to appropriate processor types. This segmentation ensures that deterministic operations receive the guaranteed execution time and priority needed for deadline compliance, while non-deterministic operations are handled by processors that can accommodate variable execution times without impacting overall system productivity.
Solution Approach 2:
The system introduces an intermediary classification mechanism that evaluates operations and routes them to appropriate processor types. This intermediary layer ensures that deterministic operations are directed to hard real-time processors for guaranteed deadline compliance, while non-deterministic operations are routed to non-hard real-time processors, maintaining overall system productivity.
3Reliability
If operations are classified and routed to appropriate processors, then deadline compliance is improved, but device complexity increases
Solution Approach 1:
The system segments the scheduling problem into two distinct domains: hard real-time scheduling for deterministic operations and non-hard real-time scheduling for non-deterministic operations. This segmentation simplifies the overall scheduling complexity by allowing each domain to use specialized scheduling algorithms optimized for its specific requirements, rather than attempting to handle all operations with a single complex scheduling mechanism.
Data Source
AI summary
Provided is a method for scheduling operations called by a task on a real-time or non-real-time processor. Execution durations are provided for operations. A call is received from a task for an operation. A determination is made of a latency requirement for a first processor and of the execution duration of the called operation. The called operation is executed on the first processor in response to determining that the determined execution duration is less than the latency requirement. The called operation is executed on a second processor in response to determining that the determined execution duration is greater than the latency requirement.