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

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

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

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

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

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

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

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

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

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

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

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

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

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

Get full text
Get full text

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

“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text

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

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

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

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

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

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

Redundancy allocation for a high security control system using estimation of distribution algorithm by Melo, Haydee, Watada, Junzo, Prof.

Get full text

Route Optimization System by Zulkifli, Abdul Hayy

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

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

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

Allocating the real power transfer in deregulated power systems using genetic algorithm by Mohd Wazir, Mustafa, Dr., Mohd Herwan, Sulaiman

Get full text

Allocating the real power transfer in deregulated power systems using genetic algorithm by Mohd Wazir, Mustafa, Mohd Herwan, Sulaiman

Get full text

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

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

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

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

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

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

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

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