Task scheduling performance in distributed systems with time varying workload
Neural, Parallel & Scientific Computations
Optimization of an internationally distributed air: ground airline telecommunication system
Computers and Operations Research
Performance Analysis of Parallel Job Scheduling in Distributed Systems
ANSS '03 Proceedings of the 36th annual symposium on Simulation
A hierarchical adaptive distributed algorithm for load balancing
Journal of Parallel and Distributed Computing
Parallel and distributed systems: load sharing in heterogeneous distributed systems
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Scalable loop self-scheduling schemes for heterogeneous clusters
International Journal of Computational Science and Engineering
Parallel and distributed algorithms and implementations: time based mutual exclusion
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
A new technique of switch & feedback job scheduling mechanism in a distributed system
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Scheduling parallel programs by work stealing with private deques
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |
Dynamic load sharing policies have been extensively studied. Most of the previous studies have assumed a homogeneous distributed system with a first-come-first-served (FCFS) node scheduling policy. In addition, job service times and inter-arrival times are assumed to be exponentially distributed. In this paper, we study the impact of these assumptions on the performance of sender-initiated and receiver-initiated dynamic load sharing policies in heterogeneous distributed systems. We consider two node scheduling policies - first-come/first-served (FCFS) and round robin (RR) policies. Furthermore, the impact of variance in inter-arrival times and job service times is studied. Our results show that, even in heterogeneous distributed systems, when the round robin node scheduling policy is used, sender-initiated policy is better than the receiver-initiated policy unless the variance in job service times is low. This is an important observation as most workstations use a scheduling policy similar to the round robin policy considered here.