A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems

PY Yin, SS Yu, PP Wang, YT Wang - Computer Standards & Interfaces, 2006 - Elsevier
In a distributed system, a number of application tasks may need to be assigned to different
processors such that the system cost is minimized and the constraints with limited resource …

A modified salp swarm algorithm for task assignment problem

WH El-Ashmawi, AF Ali - Applied Soft Computing, 2020 - Elsevier
The task assignment problem (TAP) is one of the standard combinatorial optimization
problems (COPs) in the field of discrete optimization. TAP is known to be an NP-complete …

Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization

PY Yin, SS Yu, PP Wang, YT Wang - Applied Mathematics and …, 2007 - Elsevier
In a distributed computing system (DCS), we need to allocate a number of modules to
different processors for execution. It is desired to maximize the processor synergism in order …

Maximizing availability for task scheduling in computational grid using genetic algorithm

S Prakash, DP Vidyarthi - Concurrency and Computation …, 2015 - Wiley Online Library
Computational grid provides a wide distributed platform for high‐end compute intensive
applications. Grid scheduling is often carried out to schedule the submitted jobs on the …

On maximizing reliability of grid transaction processing system considering balanced task allocation using social spider optimization

DP Mahato, RS Singh - Swarm and Evolutionary Computation, 2018 - Elsevier
This paper deals with the problem of task allocation in the grid transaction processing
system. There has been quite some research on the development of tools and techniques …

Balanced task allocation in the on‐demand computing‐based transaction processing system using social spider optimization

DP Mahato, RS Singh - Concurrency and Computation …, 2017 - Wiley Online Library
Balanced task allocation is one of the methods that can be used to maximize the
performance and reliability in the on‐demand computing‐based transaction processing …

A novel scheduling model for computational grid using quantum genetic algorithm

S Prakash, DP Vidyarthi - The Journal of Supercomputing, 2013 - Springer
Abstract The Computational Grid (CG) provides a wide distributed platform for high end
computing intensive applications. Scheduling on Computational grid is known to be NP …

A load-rebalance PSO heuristic for task matching in heterogeneous computing systems

MS Sidhu, P Thulasiraman… - 2013 IEEE Symposium …, 2013 - ieeexplore.ieee.org
The idea of utilizing nature inspired algorithms to find optimal solutions to various real world
NP complete optimization problems has been extensively explored by researchers. One …

Maximizing availability for task scheduling in on‐demand computing–based transaction processing system using ant colony optimization

DP Mahato, RS Singh - Concurrency and Computation …, 2018 - Wiley Online Library
Maximization of availability and minimization of the makespan for transaction scheduling in
an on‐demand computing system is an emerging problem. The existing approaches to find …

Load balanced transaction scheduling using Honey Bee Optimization considering performability in on‐demand computing system

DP Mahato, RS Singh - Concurrency and Computation …, 2017 - Wiley Online Library
The scheduling of load balanced transactions is an emerging problem in on‐demand
computing system. This problem can be studied considering several parameters such as …