Job Migration for Free Node Consolidation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In computer systems with large networks, job assignment can be hindered by fragmented states where free and busy nodes coexist, leading to unfeasible communication and delayed job execution, as conventional migration techniques do not effectively improve the overall operating rate due to the time required for migration.
Innovation Solution
An information processing apparatus that identifies candidate jobs for migration to free nodes, evaluates possible migrations based on communication costs and node usage, and determines the migration with the shortest time to expand the range of free nodes, thereby improving the operating rate by prioritizing effective migrations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If job migration is performed to consolidate free nodes and enable job assignment, then job assignment feasibility is improved, but system operating rate deteriorates due to migration time consumption
Solution Approach 1:
The patent changes the selection criteria for migration from a simple free-node consolidation approach to a multi-parameter evaluation system that considers communication costs, node usage, and migration time. This allows the system to select migrations that minimize operating rate impact while still achieving job assignment feasibility.
Solution Approach 2:
The patent introduces dynamic evaluation of migration candidates based on current system state, communication patterns, and job requirements. The migration selection is not static but adapts to real-time conditions, choosing the most appropriate migration target that balances consolidation needs with operational efficiency.
2Ease of operation
If conventional migration techniques are used to place free nodes together, then communication feasibility is improved, but overall execution time increases due to migration duration
Solution Approach 1:
The patent performs preliminary evaluation of multiple migration candidates before executing migration, calculating communication costs and execution time impacts in advance. This allows the system to pre-select the optimal migration target that minimizes time loss while ensuring communication feasibility.
Solution Approach 2:
The patent identifies and executes only the most critical and efficient migration among multiple candidates, skipping less optimal migrations. This rushing through of the essential migration while omitting non-essential ones reduces overall execution time while maintaining communication feasibility.
Data Source
AI summary
An information processing apparatus takes each currently executing job as a candidate job, and when determining that a migration of a candidate job to a migration destination node selected from free nodes, which are not executing any jobs, is expected to expand a continued range of free nodes, specifies the migration as a possible migration. Then, on the basis of the amounts of communication needed to perform individual migrations based on a plurality of possible migrations and the numbers of nodes used for executing candidate jobs to be migrated in the individual possible migrations, the information processing apparatus determines a possible migration to be performed.