Search Results - global distribution process algorithm

Refine Results
  1. 1

    Clock Distribution Network Building Algorithm For Multiple Ips In System On A Chip by Tan , Tze Liang

    Published 2017
    “…In this project, an algorithm is proposed and developed to build the global CDN that is used to distribute the clocks to all partitions in the SoC using the channels available between partitions. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Static and self-scalable filter range selection algorithms for peer-to-peer networks by Kweh, Yeah Lun

    Published 2011
    “…The range will be adjusted and becomes narrower while ensuring the target keys are still within it as the process iterates until the keys have been found. The selfscalable selection algorithm uses dynamic range where the filter range is not preset and is determined by the algorithm itself based on the distribution and the values of the data in the global and local file. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Statistical fixed range multiple selection algorithm for peer-to-peer system by Kweh, Yeah Lun, Othman, Mohamed, Ahmad, Fatimah, Ibrahim, Hamidah

    Published 2010
    “…A global file with n keys is distributed evenly among p peers in the peer-to-peer network. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    A non-blocking coordinated checkpointing algorithm for message-passing systems by Mansouri, Houssem, Aliouat, Makhlouf, Badache, Nadjib, Khan, Al Sakib Pathan

    Published 2015
    “…The processes synchronize their checkpointing activities so that a globally consistent set of checkpoints is always maintained in the system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

    Static range multiple selection algorithm for peer-to-peer system by Othman, Mohamed, Kweh, Yeah Lun, Ahmad, Fatimah, Ibrahim, Hamidah

    Published 2011
    “…A global file with n keys is distributed evenly among n peers in the peer-to-peer network. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Deriving global and local integrity rules for a distributed database by Ibrahim, Hamidah

    Published 2001
    “…Our technique referred to as the integrity test generation, derives global and local integrity rules has effectively reduced the cost of constraint checking in a distributed environment.…”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Distance vector-hop range-free location algorithm for wireless sensor network by Zazali, Azyyati Adiah

    Published 2015
    “…This has caused the tasks for each sensor node to be permanently fixed, thus causing the overall process of the localization algorithm to be complex. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Cost-effective scheduling analysis through discrete event simulation for distributed systems by Jalal, Siti Fajar, Hussin, Masnida, Muhammed, Abdullah, Latip, Rohaya

    Published 2015
    “…Large computing systems where globally distributed can be best characterized by their dynamic nature particularly in terms of resource provisioning and scheduling. …”
    Get full text
    Get full text
    Get full text
    Book Section
  10. 10
  11. 11

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

    Published 2011
    “…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

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

    Published 2012
    “…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.Resources with high pheromone value are selected to process the submitted jobs. Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
  13. 13
  14. 14

    An improved gbln-pso algorithm for indoor localization problem in wireless sensor network by Muhammad Shahkhir, Mozamir

    Published 2022
    “…This study aims to increase the accuracy of node estimation and to minimize time taken for the node localization process. To achieve the stated aims, we implemented an Improved Global best Local Neigborhood Particle Swarm Optimization (IGbLN-PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    An improved negative selection algorithm based on the hybridization of cuckoo search and differential evolution for anomaly detection by Ayodele Nojeem, Lasisi

    Published 2018
    “…The DE is integrated with CS at the population initialization by distributing the population linearly. This linear distribution gives the population a unique, stable, and progressive distribution process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…The process of finding superior solutions mimics the evolution process, with solutions being combined or mutated to find out the pool of solutions. …”
    Get full text
    Get full text
    Monograph
  17. 17
  18. 18

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

    Published 2011
    “…The proposed algorithm can determine the best resource to process a job in order to balance the load among resources in a grid environment. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…Since scheduling and mapping fall into NP problems, and there is no efficient exact solution for solving scheduling and mapping, the second challenge in HPAs is optimization. Meta-heuristic algorithms have widely used in HPAs due to their global optimization ability. …”
    Get full text
    Get full text
    Thesis
  20. 20

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

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph