Parallel Computer Job Assignment via Continuous Idle Region Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing parallel computer systems face inefficiencies in job assignment due to increased search costs as the number of computing nodes grows, leading to prolonged processing times when searching for continuous idle nodes for job allocation.
Innovation Solution
A parallel computer system with a management device that utilizes a node table to store assignment information and virtual nodes at connection ends, allowing for efficient search and assignment of jobs to regions with continuous idle nodes by eliminating unnecessary determination processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the parallel computer system searches all regions for continuous idle nodes using exhaustive determination, then complete job assignment coverage is achieved, but processing time increases significantly as the number of computing nodes grows
Solution Approach 1:
The patent segments the exhaustive search process into two phases: (1) preliminary identification of continuous idle node regions using efficient algorithms, and (2) verification only for regions that pass the preliminary filter. This segmentation reduces the overall search time while maintaining complete coverage for job assignment.
Solution Approach 2:
The patent performs preliminary identification of continuous idle node regions before conducting exhaustive verification. By pre-processing the node status data to identify candidate regions, the system reduces the number of regions requiring full verification, thereby decreasing total processing time while ensuring no valid regions are missed.
2Measurement precision
If the parallel computer system performs exhaustive determination for all computing nodes, then accurate idle region identification is achieved, but processing cost increases with the square of the number of nodes
Solution Approach 1:
The patent applies partial verification by performing exhaustive determination only on candidate regions identified in the preliminary phase, rather than on all possible regions. This partial action maintains sufficient accuracy for job assignment while significantly reducing processing cost compared to complete exhaustive search across all nodes.
Solution Approach 2:
The patent extracts and processes only the relevant candidate regions from the complete set of computing nodes. By taking out the subset of regions that are likely to contain continuous idle nodes based on preliminary analysis, the system reduces processing cost from O(n²) to approximately O(n) while maintaining identification accuracy.
3Adaptability or versatility
If the system searches regions by examining all computing nodes individually, then complete search coverage is ensured, but the search complexity increases quadratically with system size
Solution Approach 1:
The patent introduces a spatial dimension to the search process by organizing computing nodes into continuous regions rather than examining nodes individually. This dimensional change allows the system to process regions as unified entities, reducing algorithmic complexity from quadratic O(n²) to linear O(n) while maintaining complete search coverage across all nodes.
Data Source
AI summary
A management device includes: a memory; and a processor coupled to the memory. The processor executes a process including: storing therein an assignment table including first assignment information indicating whether a job is assigned to the information processing devices and second assignment information indicating that a job is constantly assigned to virtual information processing devices arranged at ends of a connection relation of the information processing devices; searching regions in which idle information processing devices assigned with no job are arranged continuously, using the assignment table stored at the storing; specifying a region appropriate for assignment of a job as an assignment target among the regions searched by the searching; and assigning the job as the assignment target to the region specified by the specifying.