Multi-source and multi-target password resource scheduling method

Abstract

The invention belongs to the technical field of password resource scheduling, and particularly relates to a multi-source and multi-target password resource scheduling method, which comprises the following steps of: initializing relevant parameters of password resource nodes and password task nodes; determining whether each password resource node is a focusing node or a peripheral node, and determining a gathering domain of the focusing node; for each password task node, calculating a single node guarantee capability, and for each focusing node, calculating a focusing weight; the speed of each password resource node is updated according to the single-node guarantee capability and the focusing weight, each password resource node updates the position of the password resource node through the calculated speed, and the optimal position and the optimal overall layout of each password resource node are finally obtained through repeated iteration. According to the method, when the password task node has the password resource demand, under the condition that the overall guarantee capability meets the requirement, the password resource can be deployed to the password task node as short as possible, and meanwhile, the condition that a plurality of password resource nodes are excessively gathered is avoided.

Description

technical field [0001] The invention belongs to the technical field of cipher resource scheduling, and in particular relates to a multi-source and multi-target cipher resource scheduling method. Background technique [0002] Cloud computing technology is becoming more and more mature, and it is widely used in various information systems such as government affairs, finance and industry. In order to improve service quality, it is necessary to study the management and scheduling of cloud resources, and scheduling algorithms are not developed, mainly including traditional scheduling algorithms. , prediction-based scheduling algorithm, heuristic intelligent scheduling algorithm. [0003] Traditional scheduling algorithms include first-come, first-served scheduling algorithms, high-priority scheduling algorithms, and round-robin scheduling algorithms. A first-come, first-served scheduling algorithm allocates resources to tasks based on the order in which they arrive. The high-pr...

AI Technical Summary

Problems solved by technology

The problem we want to solve is that when multiple cryptographic task nodes need cryptographic resources, the scheduling and layout of multiple cryptographic resource nodes must find the position of multiple points, not the position of a single point

At the same time, the original particle swarm optimization algorithm may have the problem of too concentrated particles near a certain location, and when it is applied to cloud resource scheduling, the load may be unbalanced

Images