High-speed algorithm for parallel task density in cloud computing pressure test

High-speed algorithm for parallel task density in cloud computing pressure test

Baiyu Guo Xianho

For the current cloud computing load stress test process, based on the idea of space exchanging time and the method of mathematical analysis, a high speed algorithm for solving parallel task density with time complexity o (n lb N) and space complexity O (n) is proposed. The experimental results show that the algorithm is more efficient than the opensta algorithm of O (n lb N) with time complexity 6~8. The algorithm can be used to solve multiple parallel task densities with the same length of time as the oldest and accurately reflect the heaviest load. This algorithm is suitable for the design of load balancing algorithm in cloud computing, and obtains the real reference data use.

High-speed algorithm for parallel task density in cloud computing pressure test