Search Results - (( based computing mechanism algorithm ) OR ( java implication based 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
    “…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. …”
    Get full text
    Get full text
    Get full text
    Monograph
  2. 2

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

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

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

    Statistically controlled robust trust computing mechanism for cloud computing by Firdhous, Mohamed, Ghazali, Osman, Hassan, Suhaidi

    Published 2014
    “…Trust computing mechanisms can play an important role in identifying the right service providers who would meet the commitments specified in the Service Level Agreements.Literature has reported several trust computing mechanisms for different distributed systems based on various algorithms and functions.Almost all of them modify the trust scores monotonously even for momentary performance deviations that are reported.This paper proposes a trust computing mechanism that statistically validates the attribute monitored before modifying the trust scores using a hysteresis based algorithm.Hence the proposed mechanism can protect the trust scores from changes due to momentary fluctuations in system performances.The experiments conducted show that the trust scores computed using the proposed mechanism are more representative of the long-term system performance than the ones that were computed without the validation of the inputs.…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    LCSS-Based Algorithm for Computing Multivariate Data Set Similarity: A Case Study of Real-Time WSN Data by Khan, Rahim, Ali, Ihsan, Altowaijri, Saleh, Zakarya, Muhammad, Rahman, Atiq Ur, Ahmedy, Ismail, Khan, Anwar, Gani, Abdullah

    Published 2019
    “…Several non-metric-based algorithms are available in the literature, the most robust and reliable one is the dynamic programming-based technique. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    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
  9. 9
  10. 10
  11. 11

    Enhanced Storage Mechanism for Secured Parallel Network File System by K J, Latesh Kumar

    Published 2018
    “…The problem statement relies how the enhancement of storage mechanism for secured parallel network file system will benefit the storage computing environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Fairness Of the TCP-based new AIMD congestion control algorithm. by Jasem, Hayder Natiq, Ahmad Zulkarnain, Zuriati, Othman, Mohamed, K. Subramaniam, Shamala

    Published 2009
    “…Our control model is based on the assumption of the original AIMD algorithm; we show that both efficiency and fairness of AIMD can be improved. …”
    Get full text
    Get full text
    Article
  13. 13

    Lexicon-based and immune system based learning methods in Twitter sentiment analysis by Jantan, Hamidah, Drahman, Fatimatul Zahrah, Alhadi, Nazirah, Mamat, Fatimah

    Published 2016
    “…In future work, the accuracy of proposed model can be strengthened by comparative study with other heuristic based searching algorithms such as genetic algorithm, ant colony optimization, swam algorithms and etc.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Adaptive DNA computing algorithm by using PCR and restriction enzyme by Watanabe, Shinpei, Tsuboi, Yusei, Ibrahim, Zuwairie, Yamamoto, Tsuneto, Ono, Osamu

    Published 2004
    “…The adaptive algorithm is designed based on Adleman-Lipton [3I paradigm of DNA computing, However, unlike the Adleman- Lipton architecture, a cutting operation has been introduced to the algorithm and the mechanism in which the molecules used by computation were feedback to the next cyclc was devised. …”
    Get full text
    Get full text
    Book Section
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20