The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Self-Organizing Agents for Grid Load Balancing
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Load Sharing in Distributed Systems
IEEE Transactions on Computers
Organization detection for dynamic load balancing in individual-based simulations
Multiagent and Grid Systems - Special Issue on Nature inspired systems for parallel, asynchronous and decentralised environments
Messor: load-balancing through a swarm of autonomous agents
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
| Hi-index | 0.00 |
Loosely connected distributed computing systems present a changing environment to the programs that they execute. Dynamic load balancing (DLB) algorithms are employed to address the problem of relocating tasks when parts of a distributed computing system become unavailable while other parts become idle. This paper presents a novel DLB algorithm based on cemetery formation in ant colonies. The algorithm builds on previous work to formulate ant-inspired DLB algorithms that aim to reduce the time needed to complete the parallel execution of multiple, independent tasks, where resources as well as tasks are diverse with respect to their performances and durations, respectively. The new algorithm is compared with its predecessors, based on division of labour in ant colonies, and pure, opportunistic load balancing, established as the baseline.