Optimizing Algorithms for low CPU Usage in Different Scenarios

This paper proposes a series of results over the image processing algorithms and for the shortest path algorithm that influence the percentage of CPU utilization. Starting with the fractal generation to image analysis, compression for big images and also any algorithm, the parallel programing is today one of the most important factor for low consumption and good power balanced for the processing unit. A good balance between the processing capacity, the algorithm and the time of processing is hard to obtain due to the number of calculus. In this work a series of results and comparison between sequential and parallel algorithms are presented. Also, there are presented test scenarios in different cases that confirm or infirm the parallel strategy chosen. This paper will integrate the results obtained with the proposed algorithms reports or comparisons of the proposed parallelization methods and will provide conclusions and ideas for future research in this field with extensive uses.