Dilation Based Bidding Schemes For Dynamic Load Balancing On Distributed Processing system

Abstract

This paper is concerned with sender-initiated load balancing algorithms for parallel architecture that take into consideration the dilation between the sender and the receiver of the migrated task. The basic scheme proposed in this paper, uses a load contention number that accounts for the dilation among processors. This mechanism is generalized to reflect the specijic requirements of different environments. W e also describe variations of the basic scheme that aim at reducing the interaction overhead among contending processors.