A hierarchical clustering scheduling method, system, medium and device

Through the hierarchical clustering scheduling method, the problem of high-delay computing bottleneck in the dedicated network with wide geographical span is solved. Through clustering scheduling, the task response time and resource imbalance are significantly reduced, and the efficient utilization of resources is achieved.

CN116095177BActive Publication Date: 2024-11-08XI AN JIAOTONG UNIV
View PDF 14 Cites 0 Cited by

Patent Information

Application Number
CN202310082477.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-02-03
Publication Date
2024-11-08
Estimated Expiration
2043-02-03

AI Technical Summary

Technical Problem

In a dedicated network environment with a wide geographical span, the new distributed high-performance low-latency computing cluster has a computing bottleneck due to unstable network topology, limited bandwidth resources and large differences in network latency between nodes, resulting in computing bottlenecks and lack of effective scheduling methods to reduce inter-tasks due to lack of effective scheduling methods to reduce inter-tasks. call response time.

Method used

The hierarchical clustering scheduling method is adopted to generate the node delay matrix by collecting resource data, select the appropriate delay hierarchy according to the task's tolerance call response time, and use the complete subgraph division method to cluster the node delay matrix, and calculate the cluster group priority. to realize hierarchical clustering scheduling of tasks, avoid high-latency nodes, and make full use of resources.

Benefits of technology

It significantly reduces call response time between tasks, balances the performance of computing resources, avoids resource overload of single nodes, and improves resource utilization efficiency and overall performance of computing system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116095177B_ABST
    Figure CN116095177B_ABST
Patent Text Reader

Abstract

The present invention discloses a hierarchical clustering scheduling method, system, medium and equipment, which collect various resource data of the cluster and generate a node delay matrix; select appropriate delay hierarchical scheduling according to the general tolerance call response time of the scheduling task, find out whether the currently selected delay layer exists, if not, use the complete subgraph partitioning method to cluster the graph composed of cluster nodes, after clustering is completed, save the clustering information in layers with different delay standards, if it exists, read the clustering information of the current delay layer; then calculate the priority of each cluster group according to the cluster group priority formula, and select the cluster group with high priority for scheduling. The present invention can significantly reduce the performance overhead of excessive task response time caused by high delay between nodes by limiting the task to be scheduled in the cluster group.
Need to check novelty before this filing date? Find Prior Art

Citation Information

Patent Citations

  • Clustering-based energy-saving scheduling method in cluster environment

    CN102231122A

  • Unified instruction scheduling and register allocating method on clustering VLIW processor

    CN104461471A

  • Method and device for improving performance of declustered disk array

    CN105573660A

  • Multi-user task scheduling method and device for calculation cluster

    CN107291545A

  • Edge computing scheduling optimization method and system

    CN110532078A