Search Results - (( java loading optimization algorithm ) OR ( based constructing computational 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
  5. 5
  6. 6

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179) by Ahmad, Nazihah, Ibrahim, Haslinda

    Published 2021
    “…With that, the constructed algorithm is considered as a new contribution to the application of control system theory…”
    Get full text
    Get full text
    Monograph
  12. 12

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20

    On the Computational Cost of Cocks’ Identity Based Encryption by Moo, Gabriel Ka Lin, Arif Mandangan, Rozaimi Zakaria

    Published 2018
    “…The first Identity Based Encryption scheme was constructed in 2001 based on elliptic curves and with pairings. …”
    Get full text
    Get full text
    Article