一种基于遗传算法的任务分配方法和装置
By using a task allocation method based on genetic algorithms, multiple gene sequence codes are generated, and the fitness of chromosome codes is calculated. This solves the problem of unreasonable allocation of user requests caused by differences in server resources, realizes reasonable allocation and rapid response of server resources, optimizes the load balancing of the web cluster, and improves the user experience.
CN114691370BActive Publication Date: 2026-07-17BEIJING WODONG TIANJUN INFORMATION TECH CO LTD +1
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- BEIJING WODONG TIANJUN INFORMATION TECH CO LTD
- Filing Date
- 2022-04-01
- Publication Date
- 2026-07-17
AI Technical Summary
Technical Problem
In existing technologies, the uneven distribution of user requests due to differences in server resources leads to unbalanced response times, resulting in resource waste and a poor user experience.
Method used
A task allocation method based on genetic algorithm is adopted. By generating multiple gene sequence codes, calculating the fitness of each chromosome code, and selecting the chromosome code with the lowest fitness to allocate the correspondence between tasks and servers, the load balancing strategy is optimized and server resources are used rationally.
Benefits of technology
It achieves reasonable allocation of server resources, responds quickly to user requests, optimizes the load balancing of the Web cluster, and improves the user experience.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN114691370B_ABST
Abstract
本发明公开了一种基于遗传算法的任务分配方法和装置，涉及计算机技术领域。该方法的一具体实施方式包括：根据待处理任务和服务器当前的资源情况进行编码，生成多段基因序列，对每段基因序列中的元素进行随机排序，得到初代染色体种群；从每个初代染色体种群中任选一个基因序列进行组合，得到多个染色体编码，计算每个染色体编码的适应度，选取两个适应度最小的染色体编码作为父代染色体编码以构建子代染色体；将子代染色体加入染色体种群中，重复迭代上述操作，得到多个子代染色体，对适应度值最小的一条子代染色体进行解码处理，得到任务编码以及服务器编码之间的对应关系，按照对应关系进行任务分配。该实施方式能合理利用服务器资源分配任务。
Need to check novelty before this filing date? Find Prior Art