Dynamical algorithm to balance the load by means of use of vectors of probabilities and adaptative matrixes.

1st Iberoamerican Congress on Ubiquitous Computing

Ángel Azpicueta González ; Juan Antonio Rodrigo Yanes ; María del Carmen Fernández Rodríguez ; Juan José Pérez

Others  :  http://CEUR-WS.org/Vol-132/paper01.pdf
PID  :  1905

来源: CEUR

【 摘 要 】

In the context of ubiquitous computation, getting the load balanced between the processing units is of relevant importance. In this study a dynamic algorithm is designedin oreder to balance the load of a computer set. A stepwise automaton selectswhich node is the most suitable one to send the required task through a probability vector (namely node to each one of the processing units of the system). This vector is obtained from a dynamical matrix being updated with the information received from the different nodes. As a result, the average computing times concerning the node-executed task are significantly reduced. Also, the algorithm allows to minimize the number of transmitted tasks, avoiding a network overload.