Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
