Search Results - (( problem grid system algorithm ) OR ( java implication based algorithm ))

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text

Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing by Alobaedy, Mustafa Muwafak Theab

“…However, ACS suffers from stagnation problem in medium and large size grid computing system. …”
Get full text
Get full text
Get full text

Scheduling jobs in computational grid using hybrid ACS and GA approach by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…Metaheuristics algorithms show very good performance in solving various job scheduling problems in computational grid systems.However, due to the complexity and heterogeneous nature of resources in grid computing, stand-alone algorithm is not capable to find a good quality solution in reasonable time.This study proposes a hybrid algorithm, specifically ant colony system and genetic algorithm to solve the job scheduling problem.The high level hybridization algorithm will keep the identity of each algorithm in performing the scheduling task.The study focuses on static grid computing environment and the metrics for optimization are the makespan and flowtime.Experiment results show that the proposed algorithm outperforms other stand-alone algorithms such as ant system, genetic algorithms, and ant colony system for makespan.However, for flowtime, ant system and genetic algorithm perform better.…”
Get full text
Get full text
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

“…Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text
Get full text

Hybrid ant colony system and genetic algorithm approach for scheduling of jobs in computational grid by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…Metaheuristic algorithms have been used to solve scheduling problems in grid computing.However, stand-alone metaheuristic algorithms do not always show good performance in every problem instance. …”
Get full text
Get full text
Get full text

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

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

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

“…Grid computing is the principle in utilizing and sharing large-scale resources of heterogeneous computing systems to solve the complex scientific problem. …”
Get full text

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

“…Grid computing enables sharing, selection and aggregation of resources for solving complex and large-scale scientific problems. …”
Get full text
Get full text

Low and high level hybridization of ant colony system and genetic algorithm for job scheduling in grid computing by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…Hybrid metaheuristic algorithms have the ability to produce better solution than stand-alone approach and no algorithm could be concluded as the best algorithm for scheduling algorithm or in general, for combinatorial problems.This study presents the low and high level hybridization of ant colony system and genetic algorithm in solving the job scheduling in grid computing.Two hybrid algorithms namely ACS(GA) as a low level and ACS+GA as a high level are proposed.The proposed algorithms were evaluated using static benchmarks problems known as expected time to compute model. …”
Get full text
Get full text
Get full text

A survey : particle swarm optimization-based algorithms for grid computing scheduling systems. by Ambursa, Faruku Umar, Latip, Rohaya

“…This study surveys PSObased scheduling algorithms for Grid systems and presents a classification for the various approaches adopted. …”
Get full text
Get full text
Get full text

Data discovery algorithm for scientific data grid environment by Abdullah, Azizol, Othman, Mohamed, Sulaiman, Md. Nasir, Ibrahim, Hamidah, Othman, Abu Talib

“…By using this model, we study various discovery algorithms for locating data sets in a data grid system. …”
Get full text
Get full text
Get full text

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

“…Many algorithms have been implemented to solve the grid scheduling problem. …”
Get full text
Get full text
Get full text

Adaptive intelligence job online scheduling within dynamic grid environment based on gridsim by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan

“…This paper concentrates on the design and implement of the grid system for study of adaptive job scheduling algorithm based on GridSim. …”
Get full text
Get full text

An efficient algorithm for independent tasks scheduling in heterogeneous computing systems by Al-Qadhi, Abdulrahman Khaldoon Mahmood

“…Task scheduling is critical in heterogenous systems, especially with the huge number of tasks transmitted over grid. …”
Get full text
Get full text

An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing by Saufi, Bukhari

“…Fault tolerance in grid computing allows the system to continue operate despite occurrence of failure. …”
Get full text
Get full text
Get full text
Get full text

Profit-based optimal generation scheduling of a microgrid by Muhamad Razali N.M., Hashim A.H.

Subjects:

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

Get full text
Get full text
Get full text

Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method by Permal, Navinesshani, Osman, Miszaina, Mohd Ariffin, Azrul, Boopalan, Navaamsini, Ab Kadir, Mohd Zainal Abidin

“…Practical features of grounding grids in various soil conditions discussed in this paper (uniform soil, two-layer horizontal soil, and two-layer vertical soil) are considered during problem formulation and solution algorithm. …”
Get full text
Get full text

Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
Get full text
Get full text
Get full text

Strategic oscillation for exploitation and exploration of ACS algorithm for job scheduling in static grid computing by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…However, the rate remains unchanged during the algorithm iterations, which makes the algorithm either bias toward exploitation or exploration.Hence, this study proposes a strategic oscillation rate to control the exploitation and exploration in ant colony system.The proposed algorithm was evaluated with job scheduling problem benchmarks on grid computing.Experimental results show that the proposed algorithm outperforms other metaheuristics algorithms in terms of makespan and flowtime. …”
Get full text
Get full text
Get full text