Search Results - (( using simulation scheduling algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

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

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
  3. 3

    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
    “…According to the simulation results, the proposed algorithm produces the best solution among all algorithms in the proposed cases. � 2021 Little Lion Scientific…”
    Review
  4. 4

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

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

    Published 2012
    “…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
  6. 6
  7. 7

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

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

    Published 2016
    “…Round Robin scheduling algorithm is the most widely used scheduling algorithm because of its simplicity and fairness [1]. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

    Published 2015
    “…Round Robin scheduling algorithm is the most widely used scheduling algorithm because of its simplicity and fairness. …”
    Get full text
    Get full text
    Thesis
  10. 10

    An FPGA implementation of exp-bet scheduling algorithm in LTE networks / Yusmardiah Yusuf by Yusuf, Yusmardiah

    Published 2017
    “…Since the implementation of scheduling algorithm is an open issue in LTE, many packet scheduling algorithms have been proposed by researchers. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems by Tan, Joe Yee

    Published 2022
    “…Simulation experiments were run using different parameters to analyze the performance of the proposed algorithm with the system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Predictive-reactive job shop scheduling for flexible production systems with the combination of optimization and simulation based algorithm by Abdul Rahman, Azrul Azwan, Joe Yee, Tan, A Rahman, Muhamad Arfauz, Salleh, Mohd Rizal, Bilge, Pinar

    Published 2020
    “…The predictive part determines the feasible schedule to be used for a flow shop which is generated using a combination of rule-based simulation and optimization: first, using the optimization algorithm to compute a rough plan, followed by using a rule based simulation system to locally fine tune the plan to obtain the final schedule. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…Furthermore, CloudSim simulator will be used to evaluate the performance of this algorithm. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  14. 14

    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
    “…Approach: The study focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks by Saqer, Ahmad Sabri Mousa

    Published 2012
    “…In order to evaluate the proposed algorithms and validate their efficiency for IEEE 802.16j networks, the authors simulated the algorithms in QualNet simulator. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Incorporating the range-based method into GridSim for modeling task and resource heterogeneity by Eng, Kailun, Muhammed, Abdullah, Mohamed, Mohamad Afendee, Hasan, Sazlinah

    Published 2017
    “…GridSim simulator has become a very popular simulation tool and has been widely used by Grid researchers to test and evaluate the performance of their proposed scheduling algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Simulated annealing algorithm for scheduling divisible load in large scale data grids. by Abdullah, Monir, Othman, Mohamad, Ibrahim, Hamidah, Subramaniam, Shamala

    Published 2009
    “…This paper proposes a novel Simulated Annealing (SA) algorithm for scheduling divisible load in large scale data grids. …”
    Get full text
    Get full text
    Article
  19. 19

    The comparison of tardiness in scheduling techniques for task distribution using grid simulation tool by Stapa @ Mustapa, Muhamad Azhar

    Published 2008
    “…The goal of this project is to test on tardiness parameter in local search based algorithms. A good scheduling algorithm normally shows lower value of total tardiness and schedule time. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

    Published 2004
    “…In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
    Get full text
    Get full text
    Article