Resource pre-allocation algorithms for low-energy task scheduling of cloud computing

In order to lower the power consumption and improve the coefficient of resource utilization of current cloud computing systems, this paper proposes two resource pre-allocation algorithms based on the ＂shut down the redundant, turn on the demanded＂ strategy here. Firstly, a green cloud computing model is presented, abstracting the task scheduling problem to the virtual machine deployment issue with the virtualization technology. Secondly, the future workloads of system need to be predicted： a cubic exponential smoothing algorithm based on the conservative control（CESCC） strategy is proposed, combining with the current state and resource distribution of system, in order to calculate the demand of resources for the next period of task requests. Then, a multi-objective constrained optimization model of power consumption and a low-energy resource allocation algorithm based on probabilistic matching（RA-PM） are proposed. In order to reduce the power consumption further, the resource allocation algorithm based on the improved simulated annealing（RA-ISA） is designed with the improved simulated annealing algorithm. Experimental results show that the prediction and conservative control strategy make resource pre-allocation catch up with demands, and improve the efficiency of real-time response and the stability of the system. Both RA-PM and RA-ISA can activate fewer hosts, achieve better load balance among the set of high applicable hosts, maximize the utilization of resources, and greatly reduce the power consumption of cloud computing systems.

Real-time tracking of deformable objects based on MOK algorithm

The traditional oriented FAST and rotated BRIEF（ORB） algorithm has problems of instability and repetition of keypoints and it does not possess scale invariance. In order to deal with these drawbacks, a modified ORB（MORB） algorithm is proposed. In order to improve the precision of matching and tracking, this paper puts forward an MOK algorithm that fuses MORB and Kanade-Lucas-Tomasi（KLT）. By using Kalman, the object＇s state in the next frame is predicted in order to reduce the size of search window and improve the real-time performance of object tracking. The experimental results show that the MOK algorithm can accurately track objects with deformation or with background clutters, exhibiting higher robustness and accuracy on diverse datasets. Also, the MOK algorithm has a good real-time performance with the average frame rate reaching 90.8 fps.