Patent ID: 8495206

Claim:
A method, in a network of a plurality of N nodes being connected together, for executing jobs based on computation of an improved network topology, the improved network topology including a number C of additional connections with respect to a current topology, the method comprising: representing the current topology of the network of the plurality of N nodes by means of an N×N Laplacian matrix M wherein values 1 i,j are defined as follows l i , j := { deg ⁡ ( v i ) if ⁢ ⁢ i = j - 1 if ⁢ ⁢ i ≠ j ⁢ ⁢ and ⁢ ⁢ v i ⁢ ⁢ adjacent ⁢ ⁢ v j 0 otherwise wherein deg(v i ) is a number of nodes that are connected to the node i and wherein 1<=i<=N and 1<=j<=N; calculating an N×N Laplacian matrix M 1 having Tr(M 1 )=Tr (M)+C* 2 and having a greatest possible second-smallest eigenvalue; modifying the network topology into an improved topology by adding C additional connections according to the calculated N×N Laplacian matrix M 1 ; starting from the modified network topology for distributing scheduling of jobs on the nodes of the modified network topology.