1. A method for workload distribution in a plurality of networked computing nodes, the networked computing nodes being arranged as a connected graph defining at least one direct neighbor to each networked computing node, the method comprising: determining a first workload indicator x i (k) of the i-th computing node out of the plurality of the networked computing nodes, at a first stage k before a new task is started by the i-th computing node; determining an estimated workload indicator y i (k+1) of the i-th computing node, assuming that the new task is performed at a second stage k+1 on the i-th node; determining ( 106 ) estimated workload indicators y j (k+1), j≦n, of each n direct neighbors of the i-th computing node assuming that the new task is performed at the second stage k+1; deciding whether to move the new task to one of the n direct neighboring computing nodes of the i-th computing node based on a decision protocol comprising: the first workload indicator x i (k) of the i-th computing node at stage k, the estimated workload indicator y i (k+1) of the i-th computing node at stage k+1, the first workload indicators x j (k) of each of the direct neighboring computing nodes to the i-th computing node at stage k, and the estimated workload indicators y i (k+1) of each of the direct neighbor computing nodes j to the i-th computing node at stage k+1; and moving the new task to one of the direct neighboring computing nodes of the i-th computing node if it is decided to move the new task such that workloads are balanced within the plurality of networked computing nodes.