作者: Jacques M. Bahi , Raphaël Couturier , Abderrahmane Sider
DOI: 10.1007/11942634_21
关键词:
摘要: Load balancing a distributed/parallel system consists in allocating work (load) to its processors so that they all have process approximately the same amount of or amounts relation with their computation power. In this paper, we present new distributed algorithm implements M2LL policy (Most Least Loaded). aims indicate pairs processors, will exchange load, taking into account actually broken edges as well current load distribution system. The fixes neighboring by selecting priority most loaded and least each neighborhood. Our main result is implementation terminates after at (n/2).dt iterations where n dt are respectively number nodes degree time t.