RTOS Preemptive Scheduling with Two-Level Priority Bitmap
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing preemptive scheduling methodologies in Real-Time Operating Systems (RTOS) require costly context saving and restoring procedures, which affect scheduling latency, and often necessitate two-level checks for task prioritization, leading to inefficiencies in multitasking and resource allocation.
Innovation Solution
A two-level priority system is introduced, where each task is assigned a kernel priority and a user-defined priority, with a priority bitmap indicating task status, allowing for simplified preemptive scheduling by avoiding context saving in certain scenarios and optimizing task prioritization based on kernel and user-defined priorities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If existing preemptive scheduling methodologies are used, then task prioritization is achieved, but scheduling latency increases due to costly context saving and restoring procedures
Solution Approach 1:
The patent extracts the priority management functionality from the traditional scheduling mechanism by introducing a separate priority bitmap data structure. This bitmap independently tracks task priorities without requiring full context saving and restoring operations, thereby reducing scheduling latency while maintaining task prioritization capabilities.
Solution Approach 2:
The patent changes the parameter representation of task priorities by using a bitmap where each bit represents a task's priority status. This parameter transformation allows for more efficient priority management compared to traditional context-based scheduling, reducing the overhead of context saving and restoring operations.
2Productivity
If traditional single-level priority scheduling is used, then simplicity is maintained, but multitasking efficiency decreases due to two-level checks requirement
Solution Approach 1:
The patent segments the priority scheduling mechanism into two independent levels: kernel priority (implemented via bitmap) and user-defined priority. This segmentation allows the system to perform efficient priority checks at the kernel level while maintaining user-level scheduling flexibility, thereby improving multitasking efficiency without significantly increasing overall system complexity.
Solution Approach 2:
The patent introduces a second dimension to priority scheduling by adding user-defined priority alongside kernel priority. This dimensional expansion enables more nuanced task management and prioritization, improving multitasking efficiency while the modular structure keeps the complexity manageable.
Data Source
AI summary
Method and apparatuses are provided for providing preemptive task scheduling for a Real Time Operating System (RTOS). A two-level priority is assigned to each task that is created. The two-level priority includes a kernel priority and a user-defined priority. A priority bitmap corresponding to the kernel priority is created. A priority bit in the priority bitmap is enabled. The priority bit indicates a status of a respective task.