Related Experiment Video
Updated: Jun 6, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Optimizing makespan and resource utilization in cloud computing environment via evolutionary scheduling approach
Faten K Karim1, Sara Ghorashi1, Salem Alkhalaf2
1Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University, Riyadh, Saudi Arabia.
Abstract:
As a new computing resources distribution platform, cloud technology greatly influenced society with the conception of on-demand resource usage through virtualization technology. Virtualization technology allows physical resource usage in a way that will enable multiple end-users to have similar hardware infrastructure. In the cloud, many challenges exist on the provider side due to the expectations of clients. Resource scheduling (RS) is the most significant nondeterministic polynomial time (NP) hard problem in the cloud, owing to its crucial impact on cloud performance. Previous research found that metaheuristics can dramatically increase CC performance if deployed as scheduling algorithms. Therefore, this study develops an evolutionary algorithm-based scheduling approach for makespan optimization and resource utilization (EASA-MORU) technique in the cloud environment. The EASA-MORU technique aims to maximize the makespan and effectively use the resources in the cloud infrastructure. In the EASA-MORU technique, the dung beetle optimization (DBO) technique is used for scheduling purposes. Moreover, the EASA-MORU technique balances the load properly and distributes the resources based on the demands of the cloud infrastructure. The performance evaluation of the EASA-MORU method is tested using a series of performance measures. A wide range of comprehensive comparison studies emphasized that the EASA-MORU technique performs better than other methods in different evaluation measures.
Related Concept Videos
Production Efficiency
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Distributed Loads: Problem Solving
Parallel Processing
Column Efficiency: Rate Theory
During elution, a solute molecule experiences numerous transitions between stationary and mobile phases, exhibiting irregular residence times in...
Distributed Loads
For example, consider a bookshelf filled with books stacked vertically adjacent to each other. The weight of the books is evenly distributed over the length of the shelf. As a result, the pressure at different locations on the surface of the...

