The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing
IEEE Transactions on Computers
Adaptive load sharing in heterogeneous distributed systems
Journal of Parallel and Distributed Computing
Adaptive Optimal Load Balancing in a Nonhomogeneous Multiserver System with a Central Job Scheduler
IEEE Transactions on Computers
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Task Scheduling Algorithms for Heterogeneous Processors
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
The Effect of Scheduling Discipline on Dynamic Load Sharing in Heterogeneous Distributed Systems
MASCOTS '97 Proceedings of the 5th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Applying statistical control techniques to air traffic simulations
WSC '04 Proceedings of the 36th conference on Winter simulation
Heterogeneity-Aware Workload Distribution in Donation-Based Grids
International Journal of High Performance Computing Applications
Optimizing the architecture of distributed shared memory systems in real time applicatons
CompSysTech '07 Proceedings of the 2007 international conference on Computer systems and technologies
Journal of Systems and Software
Analysis of coordinated load sharing for large distributed systems
International Journal of Computers and Applications
Perfect sampling of load sharing policies in large scale distributed systems
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
| Hi-index | 0.00 |
Load sharing is key to the efficient operation of distributed systems. This paper investigates load sharing policies in a heterogeneous distributed system, where half of the total processors have double the speed of the others. Processor performance is examined and compared under a variety of workloads. Two job classes are considered. Programs of the first class are dedicated to fast processors, while second class programs are generic in the sense that they can be allocated to any processor. The objective is to find a policy that results in good overall performance while maintaining the fairness of individual job classes. Simulation results indicate that the performance of the best method depends on system load.