Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Computer Networks and ISDN Systems
Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A Trace-Driven Simulation Study of Dynamic Load Balancing
IEEE Transactions on Software Engineering
The limited performance benefits of migrating active processes for load sharing
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
Finding Idle Machines in a Workstation-Based Distributed System
IEEE Transactions on Software Engineering
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
IEEE Transactions on Software Engineering
A periodic symmetrically-initiated load balancing algorithm for distributed systems
ACM SIGOPS Operating Systems Review
Efficient load information management for load sharing in distributed systems
NETWORKS '92 Proceedings of the IFIP TC6 Working Conference on Computer Networks, Architecture, and Applications. on Computer networks, architecture and applications
Utopia: a load sharing facility for large, heterogeneous distributed computer systems
Software—Practice & Experience
Methodical Analysis of Adaptive Load Sharing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Adaptive Location Policies for Global Scheduling
IEEE Transactions on Software Engineering
An Empirical Investigation of Load Indices for Load Balancing Applications
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
IEEE Transactions on Computers
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 fair workload allocation policy for heterogeneous systems
Journal of Parallel and Distributed Computing
Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
IEEE Transactions on Parallel and Distributed Systems
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.24 |
The performance of loadsharing algorithms for heterogeneous distributed systems is investigated by simulation. The systems considered are networks of workstations (nodes) which differ in processing power. Two parameters are proposed for characterising system heterogeneity, namely the variance and skew of the distribution of processing power among the network nodes. A variety of networks are investigated, with the same number of nodes and total processing power, but with the processing power distributed differently among the nodes. Two loadsharing algorithms are evaluated, at overall system loadings of 50% and 90%, using job response time as the performance metric. Comparison is made with the ideal situation of 'perfect sharing', where it is assumed that the communication delays are zero and that complete knowledge is available about job lengths and the loading at the different nodes, so that an arriving job can be sent to the node where it will be completed in the shortest time. The algorithms studied are based on those already in use for homogeneous networks, but were adapted to take account of system heterogeneity. Both algorithms take into account the differences in the processing powers of the nodes in their location policies, but differ in the extent to which they 'discriminate' against the slower nodes. It is seen that the relative performance of the two is strongly influenced by the system utilisation and the distribution of processing power among the nodes.