A COOPERATIVE ALGORITHM FOR LOAD BALANCING IN INTERCONNECTED TRANSPUTER NETWORK

In distributed systems, load balancing improves efficiency by migrating processes from heavily-loaded to lightly-loaded sites. Most distributed load-balancing algorithms utilize cooperation between the scheduler's distributed components. The algorithm we propose is on the one hand composed of a ring of idle processors, and on the other hand, of busy processors that will get different access points around the ring. Busy processors will depend on one of the idle processors of the ring. This algorithm is included in a system the objective of which is the conception of an operating system kernel which permits access to a set of transputer resources served transparently by UNIX machines on a local network. We implement our algorithm on various types of distributed architecture and we compare performances between other load-balancing policies.