Effect of Scheduling Discipline on CPU-MEM Load Sharing System

Scheduling schemes have important effects on the performance of load sharing in distributed systems. Because the load sharing policy based on CPU- memory has made the system memory an important role in effecting the system performance, it can reduce the paging fault and enhance the usage of the system resource. In light of the characteristics of the load sharing based on the CPU-memory and the variation of the jobs in executing, new CPU local scheduling schemes named more memory-request more CPU Slice based on Round Robin (RR-MMMCS) mechanism and more memory-request more CPU slice based on predicting (MMMCS-P) mechanism, are presented. Furthermore, the effects on the load sharing policy based on the CPU-memory of the variance of the inter- arrival time and service time are discussed. The trace- driven simulations show that the load sharing policy based on the CPU-memory and RR-MMMCS, MMMCS-P scheduling schemes are effective and have better performance in average response time for both CPU-memory and memory-bound jobs.

[1]  Andrzej M. Goscinski,et al.  Distributed operating systems - the logical design , 1991 .

[2]  Li Xiao,et al.  Improving distributed workload performance by sharing both CPU and memory resources , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[3]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[4]  Sivarama P. Dandamudi.  The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[5]  N. Sanguandikul,et al.  Implicit information load sharing policy for grid computing environment , 2006, 2006 8th International Conference Advanced Communication Technology.

[6]  Mor Harchol-Balter,et al.  Exploiting process lifetime distributions for dynamic load balancing , 1995, SIGMETRICS.

[7]  T. Subash,et al.  Performance analysis of scheduling disciplines in optical networks , 2006, 2006 IFIP International Conference on Wireless and Optical Communications Networks.

[8]  M. Bozyigit.  History-driven dynamic load balancing for recurring applications on networks of workstations , 2000, J. Syst. Softw..

[9]  Li Xiao,et al.  Effective load sharing on heterogeneous networks of workstations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[10]  Sivarama P. Dandamudi.  The Effect of Scheduling Discipline on Sender-Initia ted and Receiver-Initiated Adaptive Load Sharing in Homogeneous Distributed Systems† , 1995 .