A Synthetic Heuristic Algorithm for Independent Task Scheduling in Cloud Systems

It was used the algorithm “Calcula_TimeHistory” to generate the corresponding functions and this way to load the nodes of the computational model in order to obtain a time series

A general algorithm for these applications, using the algorithm in this paper, is to generate spanning trees in order of increasing cost and check at each generation whether

This paper presents the application of imperialist competitive algorithm (OCA) for optimization of milling parameters in order to minimize the synthesis time of

To measure the performance of our load balancing algorithm we use the saturation level of the grid computed as the ratio of the arrival rate (task/seconds) of total tasks to the

Experimental results indicated that the combination of the proposed ABC algorithm, scheduling based on the size of tasks, and the Longest Job First (LJF) scheduling

(5) Calculate average workload & standard deviation of all tasks in MT. c) Reordering of Li with respect to the resource capacity // Load balancing. d) Update node details

The proposed initial job placement algorithm is based on data access patterns and load balancing algorithm is based on CPU utilization, CPU queue length, memory

To address the problem of achieving both efficient load balancing and energy efficiency we design and proposed novel algorithm called EELAR (energy efficient load aware