Load transfer to a network of fully connected processors

In this paper, a model of the load transfer on a fully connected net is pre sented Each processor can accept at most K tasks. A load difference of two tasks between two processors is a Prohibited situation and when it may appe ar an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of this s tudy is to evaluate the load transfer inpact thanks to the comparison betwe en the values of the indices without transfer and with transfer. In particu lar the asymptotic behaviour for massively parallel systems is studied and interpreted. Calculated with an ideal situation, these comparisons yield up per bounds on the benefits that can be expected from a transferring policy. Beyonds the opportunity of the transfer according to the values of the par ameters can be studied. The mean number of transfers executed within a time unit and the mean number of transfers of a given task are calculated At la st values of the indices when the number of accepted tasks K grows to infin ity is studied.