Dynamic Computing Unit Time Slot Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems with real-time requirements face challenges in efficiently utilizing computing resources due to rigid time slot schemes, leading to potential resource interference and inefficient processing.
Innovation Solution
A method that allows computing operations to be executed in temporally offset time intervals, enabling the processing of additional operations in unused portions of time intervals and avoiding rigid time slot schemes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a rigid time slot scheme is used to process computing operations, then resource allocation is simplified and predictable, but computing resource utilization becomes inefficient and processing speed decreases
Solution Approach 1:
The patent applies dynamics by transitioning from a static, rigid time slot scheme to a dynamic scheduling approach. The system continuously monitors computing operation completion times and adapts the time slot allocation accordingly. When an operation completes early, the system dynamically reallocates the remaining time slot to other pending operations, making the time allocation flexible and responsive to actual processing needs rather than fixed and inflexible.
Solution Approach 2:
The patent changes the parameter of time slot allocation from fixed to variable. Instead of assigning fixed time slots regardless of actual operation duration, the system modifies time slot assignments based on actual completion times. This parameter change allows the system to optimize resource utilization by adjusting time allocation dynamically, thereby resolving the contradiction between operational simplicity and productivity efficiency.
2Device complexity
If computing operations are assigned fixed time intervals, then scheduling is straightforward, but unused time portions create resource waste and delay processing
Solution Approach 1:
The patent implements continuity of useful action by ensuring that computing resources remain continuously utilized. When an operation completes early in its allocated time slot, the system immediately assigns the remaining time portion to the next available operation. This eliminates idle time and ensures continuous productive work, resolving the contradiction between scheduling simplicity and time utilization efficiency.
Solution Approach 2:
The system performs preliminary action by preparing a queue of pending computing operations in advance. When a time slot becomes available (either through completion of the current operation or reallocation of unused time), the system has already identified the next operation to execute. This preliminary preparation enables seamless transition and prevents time waste, while maintaining relatively simple scheduling logic.
3Reliability
If time slots are strictly enforced, then task completion deadlines are guaranteed, but overall processing speed decreases due to rigid constraints
Solution Approach 1:
The system applies dynamics by making time slot allocation adaptive rather than static. While deadline guarantees remain important, the system dynamically adjusts time slot assignments based on actual operation completion times. This allows the system to maintain reliability for critical operations while accelerating overall processing by optimizing time allocation for all operations, thereby resolving the contradiction between deadline guarantee and processing speed.
Data Source
AI summary
A method for processing a first and a second computing operation in a computing unit. First and second time intervals are provided for processing the first and second computing operations in the computing unit. The method comprises a step of recognizing that the second computing operation has been completed in the second time interval at a completion time before an end of the second time interval. The method includes a step of executing the first computing operation in the second time interval after the completion time. In addition or as an alternative, the method includes a step of recognizing that the first computing operation has been completed in the first time interval at a completion time before an end of the first time interval and a step of executing the second computing operation in the first time interval after the completion time.