Transfert de Charge dans un Réseau de Processeurs Totalement Connectés

Abstract

In this paper, a model of the load transfer on a fullyconnected net is presented. Each processor can accept at most K tasks.A load difference of two tasks between two processors is a prohibitedsituation and when it may appear, an immediat and instantaneous transferis decided.The performances of the system are evaluated by the following indices:the reject probability, the throughput, the mean response time, thestationary probability distribution for a processor to host i tasks.The aim of this study is to evaluate the load transfer inpact thanks tothe comparison between the values of the indices without transfer andwith transfer. In particular the asymptotic behaviour for massivelyparallel systems is studied and interpreted. Calculated with an idealsituation, these comparisons yield upper bounds on the benefits that canbe expected from a transferring policy. Beyonds, the opportunity of thetransfer according to the values of the parameters can be studied. Themean number of transfers executed within a time unit and the mean numberof transfers of a given task are calculated. At last values of theindices when the number of accepted tasks K grows to infinity isstudied.