In this paper, a model of the load transfer on a fully
connected net is presented. 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 appear, 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 study is to evaluate the load transfer inpact thanks to
the comparison between the values of the indices without transfer and
with transfer. In particular the asymptotic behaviour for massively
parallel systems is studied and interpreted. Calculated with an ideal
situation, these comparisons yield upper bounds on the benefits that can
be expected from a transferring policy. Beyonds, the opportunity of the
transfer according to the values of the parameters 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 last values of the
indices when the number of accepted tasks K grows to infinity is
studied.