Search Results - (( java simulation optimization algorithm ) OR ( using communication pattern algorithm ))

Refine Results
  1. 1
  2. 2

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

    Published 2011
    “…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 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

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

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Butterfly traffic pattern in selection algorithm on hierarchical torus network by Rahman, M.M. Hafizur, Akhand, M. A. H, Shill, P.C., Inoguchi, Yasushi

    Published 2015
    “…In this paper, we have evaluated the dynamic communication performances of an HTN is evaluated by using dimension-order routing and LS+CS algorithm under butterfly traffic pattern. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  6. 6

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  8. 8

    The non-uniform communication performance of adaptive routing for hierarchical interconnection network for 3D VLSI by Miura, Yasuyuki, Watanabe, Shigeyoshi, Rahman, M.M. Hafizur

    Published 2015
    “…this paper, we have evaluated the dynamic performance of a TESH network using different non uniform traffic patterns. In this paper, we have evaluated by local communication traffic pattern in addition to the hotspot, perfect shuffle, and complement traffic patterns. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    High performance hierarchical torus network under matrix transpose traffic patterns by Rahman, M.M. Hafizur, Susumu, Horiguchi

    Published 2004
    “…In this paper, we present a deadlock-free routing algorithm for the HTN using virtual channels and evaluate the network’s dynamic communication performance under matrix transpose traffic, using the proposed routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  11. 11

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

    Inter-Processor Communication Performance of a Hierarchical Torus Network under Bit-Flip Traffic Patterns by Rahman, M.M. Hafizur, Ghosh, Manas, Horiguchi, Susumu

    Published 2006
    “…In this paper, we present a deadlock-free routing algorithm for the hierarchical torus network (HTN) using 2 virtual channels - 2 being the minimum number for dimension order routing - and evaluate the network's inter-processor communication performance under the bit-flip traffic pattern using the proposed routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  13. 13
  14. 14

    Dynamic communication performance of a hierarchical torus network under non-uniform traffic patterns by Rahman, M.M. Hafizur, Horiguchi, Susumu

    Published 2004
    “…In this paper, we present a deadlock-free routing algorithm for the HTN using 3 virtual channels and evaluate the network's dynamic communication performance under three non-uniform traffic patterns, using the proposed routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Dynamic communication performance of the TESH network under nonuniform traffic patterns by Rahman, M.M. Hafizur, Inoguchi, Yasushi, Sato, Yukinori, Miura, Yasuyuki, Horiguchi, Susumu

    Published 2009
    “…In this paper, we evaluate the dynamic communication performance of the TESH network using dimension order routing algorithm under various nonuniform traffic patterns. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Dynamic communication performance of a TESH network under the nonuniform traffic patterns by Rahman, M.M. Hafizur, Inoguchi, Yasushi, Sato, Yukinori, Miura, Yasuyuki, Horiguchi, Susumu

    Published 2008
    “…In this paper, we present a deadlock-free routing algorithm for the TESH network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the network's dynamic communication performance under various nonuniform traffic patterns, using the proposed routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  17. 17

    Dynamic communication performance enhancement in hierarchical torus network by selection algorithm by Rahman, M.M. Hafizur, Sato, Yukinori, Inoguchi, Yasushi

    Published 2012
    “…The dynamic communication performances of an HTN is evaluated by using dimension-order routing and proposed adaptive routing algorithms under various traffic patterns. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Dynamic communication performance enhancement in Hierarchical Torus Network by selection algorithm by Rahman, M.M. Hafizur, Sato, Yukinori, Inoguchi, Yasushi

    Published 2010
    “…The dynamic communication performances of an HTN is evaluated by using dimension-order routing and proposed adaptive routing algorithms under various traffic patterns. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  19. 19

    On hot-spot traffic pattern of TESH network by Rahman, M.M. Hafizur, Inoguchi, Yasushi, Sato, Yukinori, Miura, Yasuyuk, Horiguchi, Susumu

    Published 2008
    “…In this paper, we present a deadlock-free routing algorithm for the Tori connected mESH (TESH) network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the networks dynamic communication performance under the hot-spot traffic pattern, using the proposed routing algorithm. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  20. 20

    Routing performance enhancement in hierarchical torus network by link-selection algorithm by Rahman, M.M. Hafizur, Horiguchi, Susumu

    Published 2005
    “…We evaluate the dynamic communication performance of an HTN using dimension-order routing and link-selection algorithms under various traffic patterns. …”
    Get full text
    Get full text
    Get full text
    Article