Synchronized sweep algorithms for scalable scheduling constraints

This report introduces a family of synchronized sweep based filtering algorithms for handling scheduling problems involving resource and precedence constraints. The key idea is to filter all constraints of a scheduling problem in a synchronized way in order to scale better. In addition to normal filtering mode, the algorithms can run in greedy mode, in which case they perform a greedy assignment of start and end times. The filtering mode achieves a significant speed-up over the decomposition into independent cumulative and precedence constraints, while the greedy mode can handle up to 1 million tasks with 64 resources constraints and 2 million precedences. These algorithms were implemented in both CHOCO and SICStus

Synchronized sweep algorithms for scalable scheduling constraints

This report introduces a family of synchronized sweep based filtering algorithms for handling scheduling problems involving resource and precedence constraints. The key idea is to filter all constraints of a scheduling problem in a synchronized way in order to scale better. In addition to normal filtering mode, the algorithms can run in greedy mode, in which case they perform a greedy assignment of start and end times. The filtering mode achieves a significant speed-up over the decomposition into independent cumulative and precedence constraints, while the greedy mode can handle up to 1 million tasks with 64 resources constraints and 2 million precedences. These algorithms were implemented in both CHOCO and SICStus

Hybrid Cat Swarm Optimization and Simulated Annealing for Dynamic Task Scheduling on Cloud Computing Environment

The unpredictable number of tasks arriving at cloud datacenter and the rescaling of virtual processing elements can affect the provisioning of better Quality of Service expectations during task scheduling in cloud computing. Existing researchers have contributed several task scheduling algorithms to provide better QoS expectations but are characterized with entrapment at the local search and high dimensional breakdown due to slow convergence speed and imbalance between global and local search, resulting from lack of scalability. Dynamic task scheduling algorithms that can adjust to long-time changes and continue facilitating the provisioning of better QoS are necessary for cloud computing environment. In this study, a Cloud Scalable Multi-Objective Cat Swarm Optimization-based Simulated Annealing algorithm is proposed. In the proposed method, the orthogonal Taguchi approach is applied to enhance the SA which is incorporated into the local search of the proposed CSMCSOSA algorithm for scalability performance. A multi-objective QoS model based on execution time and execution cost criteria is presented to evaluate the efficiency of the proposed algorithm on CloudSim tool with two different datasets. Quantitative analysis of the algorithm is carried out with metrics of execution time, execution cost, QoS and performance improvement rate percentage. Meanwhile, the scalability analysis of the proposed algorithm using Isospeed-efficiency scalability metric is also reported. The results of the experiment show that the proposed CSM-CSOSA has outperformed Multi-Objective Genetic Algorithm, Multi-Objective Ant Colony and Multi-Objective Particle Swarm Optimization by returning minimum execution time and execution cost as well as better scalability acceptance rate of 0.48110.8990 respectively. The proposed solution when implemented in real cloud computing environment could possibly meet customers QoS expectations as well as that of the service providers