Resource Allocation of Distributed System Based on Hierarchical Clustering Algorithm

Abstract

The resource allocation of distributed systems has the properties of heterogeneous multi-source, autonomous peer-to-peer, and autonomous control, which is completely different from traditional computer resources. In order to use the resources of distributed systems better and more efficiently, it becomes crucial to design and implement a way to combine distributed systems and hierarchical clustering algorithms. In order to solve the problem of resource allocation in the existing distributed system, this paper summarizes the operation process of the allocation of data resources based on the centralized and distributed resource allocation strategy of system resources and the hierarchical clustering algorithm. Design and discuss the experimental environment and tools for resource allocation of distributed system based on hierarchical clustering algorithm, and design the computational flow chart of distributed font resource allocation by using hierarchical clustering algorithm. The processing time of resource allocation in the system is compared with other algorithms for experimental data analysis. The experimental data shows that the processing time of the resource allocation of the distributed system based on the hierarchical clustering algorithm is less than that of the other three algorithms, and the fastest processing time can reach 400 tasks. It takes 174.45 milliseconds, and the processing time gradually decreases with the increase of the task volume, so it verifies the superiority of the hierarchical clustering algorithm in the allocation of distributed system resources.