Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
A bridging model for parallel computation
Communications of the ACM
Communications of the ACM
Agent Assisted ServiceBSP Model in Grids
GCC '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing
Load Sharing in Distributed Systems
IEEE Transactions on Computers
Applying Processes Rescheduling over Irregular BSP Application
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Applying process migration on a BSP-based LU decomposition application
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
Hi-index | 0.00 |
Based on ServiceBSP model, a resource load balancing algorithm with Multi-Agent is put forward in this paper which achieves the goal of dynamic load balancing and favorable fault-tolerant. The algorithm calculates the load value according to the status of usage of resources of a node and scheduling tasks relies on the load value, while updating the load information dynamically depending on Multi-Agent. The method also can avoid frequent communications on load information. Furthermore, the paper introduces the function of agents, relations and communications among agents in details. Finally, by comparing response time and distribution of load using proposed method with other available methods such as without no load balancing and load balancing only based on the usage of CPU, the experimental simulation shows that the load balancing based on Multi-Agent possesses superior performance on response time and load balancing.