Search Results - (( java application optimization algorithm ) OR ( based computer colony algorithm ))

Refine Results
  1. 1

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Monograph
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2008
    “…The new algorithm is based on the ant colony system and utilizes average and maximum pheromone evaluation mechanisms. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Ant colony optimization algorithm for rule based classification: Issues and potential by Al-Behadili, Hayder Naser Khraibet, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2018
    “…Nevertheless, ACO also has several drawbacks that may reduce the classification accuracy and the computational time of the algorithm. This paper presents a review of related work of ACO rule classification which emphasizes the types of ACO algorithms and issues. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Global gbest guided-artificial bee colony algorithm for numerical function optimization by Shah, Habib, Tairan, Nasser, Garg, Harish, Ghazali, Rozaida

    Published 2018
    “…Recently, an attractive bio-inspired method—namely the Artificial Bee Colony (ABC)—has shown outstanding performance with some typical computational algorithms in different complex problems. …”
    Get full text
    Get full text
    Article
  7. 7

    Hybrid ant colony system and genetic algorithm approach for scheduling of jobs in computational grid by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2015
    “…This study proposes a high level hybrid approach between ant colony system and genetic algorithm for job scheduling in grid computing.The proposed approach is based on a high level hybridization.The proposed hybrid approach is evaluated using the static benchmark problems known as ETC matrix.Experimental results show that the proposed hybridization between the two algorithms outperforms the stand-alone algorithms in terms of best and average makespan values.…”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing by Saufi, Bukhari

    Published 2020
    “…The proposed algorithm consists of dynamic evaporation rate, resource fitness-based scheduling process, enhanced pheromone update with trust factor and suspension, and checkpoint-based task reprocessing. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing by Alobaedy, Mustafa Muwafak Theab

    Published 2015
    “…The proposed algorithms were evaluated against twelve metaheuristic algorithms in static (expected time to compute model) and dynamic (distribution pattern) grid computing environments. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13

    Enhanced ant colony optimization for grid load balancing by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Abdul Nasir, Husna Jamal

    Published 2011
    “…This paper proposes an Enhanced Ant Colony Optimization (EACO) algorithm for dynamic schedulling and load balancing in a grid computer system. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18

    Grid load balancing using enhance ant colony optimization by Ku-Mahamud, Ku Ruhana, Abdul Nasir, Husna Jamal, Mohamed Din, Aniza

    Published 2011
    “…This study presents a new algorithm based on ant colony optimization for load balancing management in grid computing. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19
  20. 20