Search Results - (( java application using algorithm ) OR ( its allocation problem algorithm ))

Refine Results
  1. 1

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

    Published 2011
    “…The proposed algorithm can overcome stagnation problem, minimize processing time, match jobs with suitable resources, and balance entire resources in grid environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2012
    “…The resource allocation problem is modelled 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. …”
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    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
    “…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

    Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

    Published 2024
    “…Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that plays a crucial role in maritime transportation systems. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

    Published 2012
    “…The four prime aspects of this work are: firstly, a model of the grid scheduling problem for dynamic grid computing environment; secondly, development of a new web based simulator (SyedWSim), enabling the grid users to conduct a statistical analysis of grid workload traces and provides a realistic basis for experimentation in resource allocation and job scheduling algorithms on a grid; thirdly, proposal of a new grid resource allocation method of optimal computational cost using synthetic and real workload traces with respect to other allocation methods; and finally, proposal of some new job scheduling algorithms of optimal performance considering parameters like waiting time, turnaround time, response time, bounded slowdown, completion time and stretch time. …”
    Get full text
    Get full text
    Thesis
  7. 7

    An improved leader particle swarm optimisation algorithm for solving flexible ac transmission systems optimisation problem in power system by Jordehi, Ahmad Rezaee

    Published 2014
    “…It should efficiently mitigate premature convergence problem and result in lower amounts of overloads, voltage deviations and power losses (than existing algorithms) in D-TCSC allocation problem during line outage contingencies. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Development of multi-objective Chaotic Immune Symbiotic Organisms Search (CISOS) algorithm for facts device installation in voltage security control / Mohamad Khairuzzaman Mohamad... by Mohamad Zamani, Mohamad Khairuzzaman

    Published 2019
    “…Several case studies were also subjected to the optimal FACTS device allocation problem to observe the variation of results when the power system is operating at different conditions. …”
    Get full text
    Get full text
    Thesis
  9. 9

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Power generation allocation in smart grid using Dwarf Mongoose Optimization / Mohamad Irfan Shamani by Shamani, Mohamad Irfan

    Published 2025
    “…A real-word problem where DMO could be used is optimization energy allocation within power generation system. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Meta-scheduler in Grid environment with multiple objectives by using genetic algorithm by Lorpunmanee, Siriluck, Sap, M.N.M, Abdullah, Abdul Hanan, Srinoy, Surat

    Published 2006
    “…The minimization is proposed by using a multiple objective genetic algorithm (GA), because the job scheduling problem is NP-hard problem. …”
    Get full text
    Article
  13. 13
  14. 14
  15. 15

    Impatient job scheduling under cloud computing by Mahdi, Nawfal A.

    Published 2012
    “…W e modeled the problem as a set of events and proposed an algorithm that finds a proper virtual machine that can donate its bandwidth amount with full compliance to virtual machines deadlines and Q uality of Service ( Q oS) constraints. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Throughput-aware resource allocation for QoS classes in LTE networks by Ferdosian, Nasim, Othman, Mohamed, Mohd Ali, Borhanuddin, Kweh, Yeah Lun

    Published 2015
    “…We fine tune the Knapsack algorithm, to overcome this problem and improve system performance objectives. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Solving New Student Allocation Problem (NSAP) With Analytical Hierarchy Process (AHP) by Shahbodin, Faaizah, Wan Hassim, Wan Haniza, Shibghatullah, Abdul Samad

    Published 2014
    “…There are many approaches used to solve New Student Allocation Problem (NSAP).Many researchers use application of Genetic Algorithm (GA).However,the study presented in this paper applies an Analytical Hierarchy Process (AHP)technique in solving New Student Allocation Problem (NSAP) handled by Registration Unit at Ungku Omar Polytechnic.The problem is the students are allocated to their class randomly,just by using their registration number and by all means without referring to their intelligence level,knowledge,skills and also their performance.So,in this paper the researcher’s focus is on solving NSAP by using AHP to allocate students into their respective classes with minimum intelligence gap in each class and the number of students in each class does not exceed its maximum capacity.The proposed solution will be tested using real data from the Politeknik Ungku Omar to see the result. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Solving New Student Allocation Problem (NSAP) with Analytical Hierarchy Process (AHP) by Wan Hussin, Wan Haniza, Shibghatullah, Abdul Samad, Shahbodin, Faaizah

    Published 2014
    “…There are many approaches used to solve New Student Allocation Problem (NSAP). Many researchers use application of Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  19. 19

    Adaptive and optimized radio resource allocation algorithms for OFDMA based networks by Saadat, Md. Nazmus

    Published 2015
    “…Also it considers the problem of making the total allocation cycle efficient to be calculated and thus separates the power allocation from doing it simultaneously with optimized subcarrier allocation. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Development of a task-oriented, auction-based task allocation framework for a heterogeneous multirobot system by Tan, Eijyne, Rishwaraj, G., Ponnambalam, S. G.

    Published 2020
    “…A multirobot system has cooperative team of robots designed to enhance efficiency of its operations. One of the critically investigated problems of multirobot system is the multirobot task allocation (MRTA) issue. …”
    Get full text
    Get full text
    Get full text
    Article