A Distributed Placement Algorithm Based on Process Initiative and on a Limited Travel.
Christophe Lang, Michel Tréhel, Pierre Baptiste · 1999
This paper presents a new load sharing method for workstation networks in a UNIX environment. We know that the global computing power is most of the time much underutilized in this kind of networks. Our goal is to share the load among the different processors. Usually, load sharing algorithms are based on the fact that information and decision of distribution are on the processor. We aim to give processes the ability to decide where they are going to run. This method is based on the independence and the initiative of entities. We have written behavior algorithms for independent processes : we present one of them in this paper. The performance measurements have been obtained on a distributed system simulator that we have developed. We think that this paper is relevant to the topic : parallel and distributed algorithms. Keywords: load sharing, process migration, distributed behavior, processor load, independence 1 Introduction We are in the context of load sharing on distributed system...