Job Scheduling by Priority Grouping for Execution Timing Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing job scheduling systems face inefficiencies in resource utilization and delayed execution times when handling multiple jobs with varying node usage and execution times, often resulting in delayed completion of lower-priority jobs and unsatisfied system conditions.
Innovation Solution
An information processing apparatus that groups jobs by priority and schedules their execution to prioritize higher-priority jobs while ensuring all jobs in a group meet a predetermined completion time condition, optimizing resource usage and preventing delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If jobs are scheduled without grouping by priority, then resource utilization may be improved through better distribution, but execution completion time of high-priority jobs is delayed
Solution Approach 1:
The patent segments jobs into different priority groups (first priority group and second priority group) based on their priority levels. This segmentation allows the scheduling system to handle high-priority jobs separately from lower-priority jobs, ensuring that high-priority jobs are executed first and meet their completion time requirements, while still allowing efficient resource utilization for the overall job set.
2Loss of time
If high-priority jobs are executed first without grouping, then execution completion time of high-priority jobs is improved, but resource utilization decreases due to idle periods
Solution Approach 1:
The patent performs preliminary grouping of jobs into priority-based job groups before scheduling execution. By pre-organizing jobs into first and second priority groups, the system can systematically execute high-priority jobs first while maintaining a structured approach that prevents resource idle periods, thereby achieving both timely completion of high-priority jobs and efficient resource utilization.
3Reliability
If jobs are grouped by priority with strict scheduling, then execution completion time of high-priority jobs is guaranteed, but system adaptability to varying job conditions decreases
Solution Approach 1:
The patent implements a dynamic scheduling approach where jobs are grouped by priority but the scheduling within each group can adapt to varying job conditions. The system dynamically assigns execution times based on the specific characteristics of jobs within each priority group, allowing it to maintain reliability for high-priority job completion while adapting to different job durations, resource requirements, and execution conditions.
Data Source
AI summary
An information processing apparatus includes a memory and a processor couple to the memory and configured to generate one or more job groups by grouping multiple jobs of execution targets in descending order of priority, and perform a control for scheduling execution timings regarding the multiple jobs such that scheduling of respective jobs included in a specific job group including a job having a higher priority is implemented by priority over scheduling of respective jobs included in other job groups. The processor performs the control for scheduling the execution timings of the respective jobs included in the specific job group such that an execution completion time of all the jobs included in the specific job group satisfies a predetermined condition.


