Search Results - (( java simulation optimization algorithm ) OR ( _ computer system algorithm ))

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

“…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
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

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

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

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

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

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

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.

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

SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment by Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Muzahid, Abu Jafar Md, Bhuiyan, Md Khairul Bashar, Saib, Md, Rahimi, Nick, Prottasha, Nusrat Jahan, Bairagi, Anupam Kumar

“…To conduct this experiment, we employed the CloudSim simulator, which is implemented using the Java programming language.…”
Get full text
Get full text
Get full text
Get full text

Anfis Modelling On Diabetic Ketoacidosis For Unrestricted Food Intake Conditions by Saraswati, Galuh Wilujeng

“…The project has also implemented the optimization process onto the proposed ANFIS model through the hybrid of Genetic Algorithm on the fuzzy membership function of the ANFIS model. …”
Get full text
Get full text
Get full text
Get full text

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

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

Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text

System program management environment in cloud computing using hybrid Genetic Algorithm and Moth Flame Optimization (GA-MFO) by Mohd Erwan Mazalan

“…This project present a system program algorithm based on Moth Flame Optimization (MFO) algorithm to assign an optimal set of system program to meet the satisfaction of quality of service requirements of cloud computing in such a way that the total execution time of tasks is minimized. …”
Get full text
Get full text
Get full text

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

Subjects: 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

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

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

“…Grid computing is a distributed system with heterogeneous infrastructures. …”
Get full text
Get full text
Get full text

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

Two Stages Transfer Algorithm (TSTT) for independent tasks scheduling in heterogeneous computing systems by Al-Qadhi, Abdulrahman K., Ariffin, Ahmad Alauddin, Latip, Rohaya, Abdul Hamid, Nor Asila Wati, Al-Zubaidi, Ammar S.

“…Since heuristics are proposing methods for solving heterogeneous computing systems, several techniques were proposed for the scheduling on grid computing systems to get better execution time. …”
Get full text
Get full text

Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

Subjects: Get full text
Get full text

Improved rsync algorithm to minimize communication cost using multi-agent systems for synchronization in multi-learning management systems by Mwinyi, Amir Kombo

“…This study proposed several techniques to improve rsync (irsync) algorithm in order to reduce computation time during RFS, by encompasses a Multi-Agent system (MAS) framework. …”
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