Search Results - (( developing executive computer algorithm ) OR ( java _ optimization 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
    “…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
  3. 3

    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
  4. 4

    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
  5. 5

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2020
    “…The proposed algorithm was developed in a simulated grid environment called GridSim and evaluated against other fault tolerance algorithms such as trust-based ACO, fault tolerance ACO, ACO without fault tolerance and ACO with fault tolerance in terms of total execution time, average latency, average makespan, throughput, execution success rate and load balancing. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…The aim of this evolution is to reflect the unseen time overhead incurred by optimal real-time algorithm, represented by LRE-TL, which might hinder the claimed optimality of such algorithms when they are practically implemented. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

    Published 2013
    “…The optimization of a computationally intensive algorithm such as this on a mobile platform is challenging due to the limited resources available. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    RISC-V instruction set extension on blockchain application by Cheong , Kin Seng

    Published 2024
    “…In this project, some instructions were proposed to execute the cryptographic algorithm in shorter clock cycles and shorter execution time. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  10. 10

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…In the first, the Improved Zero algorithm is proposed to solve the problem and secondly, the Bitwise Improved Zero algorithm is developed. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  12. 12

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
    Get full text
    Get full text
    Get full text
    Book
  13. 13

    Pengesan lalu lintas dengan kaedah pemerosesan imej by Riza Atiq O.K.Rahmat, Kasmiran Jumari, Azmi Hassan, Hassan Basri

    Published 2001
    “…This study was conducted to develop efficient traffic detector using image-processing with a personal compute I: Traffic images were captured using ordinary analogue video camera and digitised using a video blastel: Four algorithms were developed i. e. algorithm for traffic counting, algorithm for vehicle classification. algorithm to determine the speed of the counted vehicles and algorithm for incident detection. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks by Moudi, Mehrnaz

    Published 2012
    “…This algorithm has been developed to achieve performance goals in terms of 50% reduction in the number of passes.…”
    Get full text
    Get full text
    Thesis
  16. 16

    Parallel block methods for solving higher order ordinary differential equations directly by Omar, Zurni

    Published 1999
    “…These methods approximate numerical solution at one point at a time and therefore do not fully exploit the capability of parallel computers. Hence, the development of parallel algorithms to suit these machines becomes essential. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    The visualization of power density and temperature distribution of electronic system using elliptic PDE solver by Alias, Norma, Satam, Noriza, A. Ghaffar, Zarith Safiza

    Published 2008
    “…Numerical analysis is done in terms of execution time, number of iterations and computational complexity of the algorithm being used. …”
    Get full text
    Get full text
    Article
  19. 19

    A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment by Ahmad, Idawaty, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zukarnain, Zuriati

    Published 2011
    “…Conclusion: Extensive performance analysis of GUS simulator can be deployed using the developed simulator with low computational overhead. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article