Job Scheduling for Software Version-Matched Parallel Nodes

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In parallel processing systems, update jobs for control software can cause user jobs to be delayed due to nodes completing their current tasks at different times, leading to inefficiencies and potential execution failures when nodes have different software versions.

Innovation Solution

A job scheduler determines the possible start time for user jobs based on the version of control software on each node and the scheduled end time of running jobs, adjusting the priority of update jobs to minimize user job delays by ensuring nodes with the same software version are available when needed.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If update jobs are executed on nodes with different software versions, then system maintenance is performed, but user jobs may be delayed or fail due to version incompatibility

Engineering Contradiction:
Improveuser job execution reliabilityVSAvoiduser job waiting time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary actions by checking software version compatibility before scheduling user jobs. The job scheduler identifies nodes with matching software versions in advance and prepares the allocation plan accordingly, ensuring that user jobs are only assigned to compatible nodes, thus preventing execution failures and delays

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements feedback mechanisms by continuously monitoring the software versions of nodes and updating the job scheduling decisions based on this information. The job scheduler receives feedback about node versions and adjusts the allocation of user jobs dynamically, ensuring compatibility while minimizing waiting time

Inventive Principle:
Principle #23Feedback

2Reliability

If the job scheduler waits for nodes to complete current tasks before allocating update jobs, then software updates can be applied, but user job execution is delayed

Engineering Contradiction:
Improvesoftware update reliabilityVSAvoiduser job throughput
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The job scheduler dynamically adjusts its behavior based on real-time system conditions. Instead of rigidly waiting for node completion, the scheduler continuously evaluates node availability, software versions, and job priorities, making flexible scheduling decisions that balance update reliability with user job throughput

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes scheduling parameters dynamically, such as priority levels and allocation strategies, based on the current state of nodes and jobs. By adjusting these parameters, the system can prioritize updates when necessary while maintaining high user job throughput during other periods

Inventive Principle:
Principle #35Parameter changes

3Productivity

If nodes with different software versions are allocated to user jobs, then node utilization is maximized, but job execution may fail due to version incompatibility

Engineering Contradiction:
Improvenode utilization efficiencyVSAvoidjob execution success rate
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The job scheduler performs preliminary version compatibility checks before allocating nodes to user jobs. By verifying software version compatibility in advance, the system ensures that only compatible node-job pairs are matched, maintaining high execution success rates while still achieving efficient node utilization

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system applies local quality by matching specific node versions with compatible job requirements. Instead of treating all nodes uniformly, the scheduler considers the specific software version of each node and allocates jobs accordingly, ensuring local compatibility while maintaining overall system efficiency

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS20250390344A1Job scheduling method and information processing apparatus
Publication Date: 2025.12.25 FUJITSU LTD
  • US20250390344A1 patent drawing
  • US20250390344A1 patent drawing
  • US20250390344A1 patent drawing

AI summary

An information processing apparatus identifies, from among a plurality of execution waiting jobs, an update job for updating control software on a target node and a user job specifying the number of nodes to be used indicating how many nodes to use. The information processing apparatus calculates a possible start time at which the number of idle nodes having the same version becomes greater than or equal to the number of nodes to be used, based on the versions of the control software on the plurality of nodes and the scheduled end times of running jobs. The information processing apparatus determines, based on a processing time needed to execute the update job and the possible start time, whether to prioritize execution of the update job or the user job.