Cloud Computing Research Yields New Insights into Task Scheduling with Genetic Algorithms

Strategic Insights -

Researchers at Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology have made significant strides in cloud computing task scheduling using genetic algorithms. Their study, published in the CLEI Electronic Journal, presents a novel probabilistic genetic algorithm approach to optimize task allocation in cloud environments. This breakthrough has far-reaching implications for improving cloud resource management and reducing execution costs.

Key Takeaways:

  • The study focuses on task scheduling, a critical component of cloud computing systems, where tasks are allocated to precise resources for execution.
  • The researchers utilized a genetic algorithm (GA) to optimize task allocation, leveraging its ability to resolve complex problems rapidly.
  • The proposed model, a probabilistic genetic algorithm (PGA), outperformed existing scheduling techniques, with a completion time of 10,841 ms at 1000 iterations.
  • The PGA's performance was calculated using the Simpy toolkit, demonstrating its capacity to optimize resource utilization and balance competing time requirements.
  • The study highlights the importance of genetic operators such as selection, crossover, and mutation in directing the solution space to determine optimal tasks.
  • The experimental results revealed the PGA's effectiveness in reducing execution costs and completion time, making it an attractive approach for cloud resource management.
  • The study provides a valuable framework for future research in cloud computing, focusing on optimizing resource utilization and improving scalability and availability.

Statistics:

  • The completion time of the proposed PGA model at 1000 iterations was 10,841 ms.
  • The PGA outperformed existing scheduling techniques, indicating its efficacy in optimizing task allocation.
  • The study's results demonstrate the potential for genetic algorithms to improve cloud resource management, with a completion time reduction of up to 10,841 ms.
  • The PGA's performance was calculated using the Simpy toolkit, which indicated its capacity to outperform existing scheduling techniques.
  • A total of 1000 iterations were used to assess the PGA's effectiveness.

Sources:

  • A Probabilistic Genetic Algorithm Approach to Efficient Task Scheduling in Cloud Environments. CLEI Electronic Journal, 2025,28(5).
  • CLEI Electronic Journal - http://www.clei.org/cleiej/
  • Centro Latinoamericano de Estudios en Informatica, Publisher
  • https://doi-org.sdpl.idm.oclc.org/10.19153/cleiej.28.5.9