A negotiation protocol for batch task assignments in dynamic load distribution
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Load Sharing in Distributed Multimedia-on-Demand Systems
IEEE Transactions on Knowledge and Data Engineering
Tunable randomization for load management in shared-disk clusters
ACM Transactions on Storage (TOS)
Handling Heterogeneity in Shared-Disk File Systems
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Performance Evaluation Model for Scheduling in Global Computing Systems
International Journal of High Performance Computing Applications
A Grid-based Virtual Reactor: Parallel performance and adaptive load balancing
Journal of Parallel and Distributed Computing
An analytical model for performance evaluation in a computational grid
CHINA HPC '07 Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing
How to Balance the Load on Heterogeneous Clusters
International Journal of High Performance Computing Applications
Distributed visibility culling technique for complex scene rendering
Journal of Visual Languages and Computing
An adaptive load balancing management technique for RFID middleware systems
Software—Practice & Experience
Methods of task redistribution in multiagent systems
KES-AMSTA'10 Proceedings of the 4th KES international conference on Agent and multi-agent systems: technologies and applications, Part I
Parallel pattern detection for architectural improvements
HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
We propose an adaptive load balancing algorithm for heterogeneous distributed systems. The algorithm intrinsically allows a batch of tasks to be relocated. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. Composition of a task batch is modeled as a 0-1 Knapsack problem. We also propose a load state measurement scheme which is designed particularly for heterogeneous systems.