Abstract
Adynamic load distribution(LD) algorithm improves the performance of a distributed system by using current system load information to relocate application tasks among processing nodes, so that workload imbalance in the system can be smoothed out. In this paper, we propose aguarantee and reservation protocol(GR protocol) which can be used by dynamic LD algorithms. In contrast to the commonly usedsingle task assignments, GR protocol usesbatch task assignments, meaning that multiple tasks can be selected for remote execution during each single sender–receiver negotiation session. GR protocol is used to obtain a mutual agreement between a task sender and a receiver on an appropriate task batch size. GR protocol is based on avirtual workload modelwhich ensures coordinated even dispersements of tasks in the system. This model also avoidsprocessor thrashing, a situation when a receiver node is flooded with excessive remotely assigned tasks and thus becomes overloaded inadvertently.
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.
