Search Results - (( java loading optimization algorithm ) OR ( based computing best algorithm ))
Search alternatives:
- loading optimization »
- based computing »
- computing best »
- best algorithm »
- java »
-
1
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…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
Monograph -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…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
Thesis -
3
Resource management in grid computing using ant colony optimization
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 -
4
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
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
-
6
-
7
-
8
The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi
Published 2017“…Base on listed companies, the student can choose the best company for them to make the internship. …”
Get full text
Get full text
Thesis -
9
Probability based fast inter mode decision algorithm for H.264/AVC
Published 2016“…In this paper, a new probability based fast inter mode decision algorithm is proposed for H.264/AVC video standard. …”
Get full text
Get full text
Article -
10
Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches
Published 2015“…At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
A comparative analysis of task scheduling algorithms of virtual machines in cloud environment
Published 2023“…Based on the analysis of the simulation result, we can conclude which algorithm is the best for scheduling in terms of energy and performance of VMs. …”
Article -
12
Comprehensive power restoration approach using rule-based method for 11kV distribution network
Published 2023“…This paper presents a restoration algorithm based on a Rule-Based approach. The algorithm is computationally programmed to provide multiple solutions and to recommend the best option of switching for a dispatcher. …”
Conference Paper -
13
The use of people rank technique for data dissemination in opportunistic network
Published 2015Get full text
Get full text
Get full text
Final Year Project Report / IMRAD -
14
Optimizing BOINC scheduling using genetic algorithm based on thermal profile
Published 2014“…We use genetic algorithm to find the best combination of clients and jobs based on clients order and least execution time. …”
Get full text
Get full text
Conference or Workshop Item -
15
Task scheduling on computational grids using Gravitational Search Algorithm
Published 2014“…In this paper, Gravitational Search Algorithm (GSA), as one of the latest population-based metaheuristic algorithms, is used for task scheduling on computational Grids. …”
Get full text
Get full text
Article -
16
An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing
Published 2020“…Experimental results showed that the proposed algorithm achieved the best performance in most aspects, and second best in terms of load balancing. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Performance Comparison of Parallel Bees Algorithm on Rosenbrock Function
Published 2012“…It is a series of activities based on the searching algorithm in order to access the best solutions. …”
Get full text
Get full text
Get full text
Thesis -
18
A hyper-heuristic based strategy for image segmentation using multilevel thresholding
Published 2025“…To address these issues, this work proposes a novel multilevel thresholding strategy using Exponential Monte Carlo with Counter (EMCQ) hyper-heuristic for the segmentation of Computed Tomography (CT) chest images. EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
Get full text
Get full text
Get full text
Article -
19
Multi-base number representation in application to scalar multiplication and pairing computation
Published 2011“…These algorithms are formulated for computing Tate and ate pairing. …”
Get full text
Get full text
Thesis -
20