Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
File access performance of diskless workstations
ACM Transactions on Computer Systems (TOCS)
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
Distributed scheduling for a changing environment
Distributed scheduling for a changing environment
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
Profiling Workstations' Available Capacity for Remote Execution
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
IEEE Transactions on Parallel and Distributed Systems
New job selection and location policies for load-distributing algorithms
International Journal of Network Management
Power conservation strategy for mobile computers using load sharing
ACM SIGMOBILE Mobile Computing and Communications Review
Improved Strategies for Dynamic Load Balancing
IEEE Concurrency
IEEE Transactions on Knowledge and Data Engineering
Integrated scheduling of tasks and messages in distributed real-time systems
Engineering of distributed control systems
Optimizing Static Job Scheduling in a Network of Heterogeneous Computers
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
A new fuzzy-decision based load balancing system for distributed object computing
Journal of Parallel and Distributed Computing
Effect of network latency on load sharing in distributed systems
Journal of Parallel and Distributed Computing
On the performance-driven load distribution for heterogeneous computational grids
Journal of Computer and System Sciences
Instantiation of a Generic Model for Load Balancing with Intelligent Algorithms
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
ESAW '09 Proceedings of the 10th International Workshop on Engineering Societies in the Agents World X
An adaptive load balancing management technique for RFID middleware systems
Software—Practice & Experience
Assignment schemes for replicated services in Jini
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Load and performance balancing scheme for heterogeneous parallel processing
CIS'04 Proceedings of the First international conference on Computational and Information Science
Towards decentralized load balancing in a computational grid environment
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Machine learning-based adaptive load balancing framework for distributed object computing
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Case study: Evaluation of loadsharing algorithms for heterogeneous distributed systems
Computer Communications
| Hi-index | 0.00 |
Two important components of a global scheduling algorithm are its transfer policy and its location policy. While the transfer policy determines whether a task should be transferred, the location policy determines where it should be transferred. Based on their location policies, global scheduling algorithms can be broadly classified as receiver-initiated, sender-initiated, or symmetrically-initiated. The relative performance of these classes of algorithms has been shown to depend on the system workload. We present two adaptive location policies for global scheduling in distributed systems. These location policies are general, and can be used in conjunction with many existing transfer policies. By adapting to the system workload, the proposed policies capture the advantages of both sender-initiated and receiver-initiated policies. In addition, by adaptively directing their search activities toward the nodes that are most likely to be suitable counterparts in task transfers, the proposed policies provide short transfer latency and low overhead, and more important, high probability of finding a suitable counterpart if one exists. These properties allow these policies to deliver good performance over a very wide range of system operating conditions. The proposed policies are compared with nonadaptive policies, and are shown to considerably improve performance and to avoid causing system instability.