Search Results - (( java application scheduling algorithm ) OR ( based optimization problems algorithm ))
Search alternatives:
- application scheduling »
- java application »
- problems »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
3
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
4
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 -
5
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. …”
Get full text
Get full text
Conference or Workshop Item -
6
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…In this type of environment it is nearly impossible to prove the effectiveness of a scheduling algorithm. Hence the main objective of this study is to develop a desktop grid simulator toolkit for measuring and modeling scheduler algorithm performance. …”
Get full text
Get full text
Final Year Project -
7
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
Published 2006“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text
Thesis -
8
Improving Class Timetabling using Genetic Algorithm
Published 2006“…This paper reports the power fill techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text
Thesis -
9
Examination timetabling using genetic algorithm case study: KUiTTHO
Published 2005“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Thesis -
10
Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO
Published 2005“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text
Thesis -
11
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem
Published 2015“…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…Many algorithms have been implemented to solve the grid scheduling problem. …”
Get full text
Get full text
Get full text
Thesis -
13
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text
Thesis -
14
Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation
Published 2022“…Finally, a crowding distance and non-dominated-sorting-based multi-objective hybrid firefly & particle swarm optimization (MOHFPSO) algorithm is designed for MOOPF problems. …”
Get full text
Get full text
Thesis -
15
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
16
Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems
Published 2022“…To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. …”
Get full text
Get full text
Get full text
Article -
17
Optimal power flow based on fuzzy linear programming and modified Jaya algorithms
Published 2017“…Finally, two novel hybrid optimization algorithms namely, FLP-QOJaya algorithm for single objective OPF problems and MFLP-QOMJaya algorithm for MOOPF problems are proposed. …”
Get full text
Get full text
Thesis -
18
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
Published 2024“…The trained network is then applied to benchmark classification problems. Based on the experimental results, the optimized DA algorithm is a much better training algorithm for ANNs as compared to the usual gradient-descent backpropagation algorithm since the resultant ANNs trained by the optimized DA achieve higher accuracy. …”
Get full text
Get full text
Thesis -
19
A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems
Published 2015“…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20
AN ENSEMBLE APPROACH OF METAHEURISTIC ALGORITHMS WITH PARABOLIC APPROXIMATION TO OPTIMIZE WELL PLACEMENT PROBLEM
Published 2021“…However, the ensemble algorithm often changes search strategies and adds an algorithm based on their success, which makes it more reliable on multimodal optimization problems. …”
Get full text
Get full text
Thesis
