Program Cycle Allocation via Greatest Common Denominator Base Periods
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional multitasking operating systems fail to efficiently manage programs with varying operating cycles, leading to inadequate processing capability allocation and resulting in wasted resources due to mismatched processing demands.
Innovation Solution
A data processing device and scheduler that calculate the greatest common denominator of individual operating times to allocate programs into continuous base periods, starting with the shortest operating cycles, ensuring efficient operation and utilization of processing capability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If processing capability is allocated in advance to programs with short operating cycles, then short-cycle programs can be executed efficiently, but processing capability is wasted when there are few such programs
Solution Approach 1:
The system dynamically adjusts the allocation of processing capability based on the actual number and characteristics of running programs. Instead of static pre-allocation, the scheduler continuously monitors program execution status and reallocates time slots in each base period to match current demands, ensuring both efficiency and resource utilization
Solution Approach 2:
The invention changes the parameter of processing capability allocation from fixed to variable. By calculating the greatest common denominator of operating cycles to establish base periods, and then dynamically assigning programs to time slots within these periods based on current program mix, the system adapts processing allocation to actual needs
2Adaptability or versatility
If multiple programs with different operating cycles are executed using multitasking operating systems, then program diversity is supported, but strict observance of operating cycles cannot be guaranteed
Solution Approach 1:
The invention segments the continuous time axis into discrete base periods based on the greatest common denominator of all program operating cycles. Each base period is further divided into time slots assigned to specific programs, creating a structured schedule that guarantees strict observance of operating cycles while supporting program diversity
Solution Approach 2:
The system implements periodic scheduling where programs are allocated to specific time slots within repeating base periods. This periodic structure ensures that each program receives guaranteed execution time at regular intervals, maintaining strict operating cycle observance while accommodating multiple program types with different cycle requirements
3Productivity
If processing capability is allocated in advance to programs with long operating cycles, then long-cycle programs can run smoothly, but processing capability openings occur when there are only a few such programs
Solution Approach 1:
The system dynamically fills processing capability openings by allocating available time slots to programs based on current execution needs. When long-cycle programs occupy few time slots, the scheduler automatically assigns remaining capacity to other programs within the same base period, eliminating unused processing capability
Solution Approach 2:
The base period structure serves multiple functions: it guarantees execution for long-cycle programs while simultaneously providing a framework for flexible allocation to short-cycle and medium-cycle programs. This universal scheduling structure eliminates processing capability openings by allowing any program to utilize available time slots
Data Source
AI summary
The present invention comprises: a unit time calculating unit for calculating, as a unit time, the greatest common denominator of the individual operating cycles of a plurality of programs; an allocating unit for allocating the individual operating cycles of the plurality of programs into each of a plurality of continuous base periods that each have their respective unit times, in sequence beginning with the shortest operating cycle, and for allocating the operating cycles of remaining programs for which the operations have not been completed during one of the plurality of base periods into remaining base periods, in sequence beginning with the shortest operating cycles; and an operating unit for running the plurality of programs that are allocated to operating times.


