Research Article

Simulated Annealing Algorithm Combined with Chaos for Task Allocation in Real-Time Distributed Systems

Table 1

Simulation results for the case of 12 nodes.

CasesXASASA1SA2

12 16 0.9349 3.336 0.9361 39.266 0.9353 10.409 91.50% 67.95% 73.49% 0.13% 0.04%
18 0.9135 3.914 0.9152 50.188 0.9151 13.237 92.20% 70.43% 73.62% 0.18% 0.17%
20 0.8948 4.014 0.8992 57.456 0.8968 14.454 93.01% 72.23% 74.84% 0.49% 0.22%
22 0.8733 4.918 0.8781 55.815 0.8777 14.474 91.19% 66.02% 74.07% 0.55% 0.50%
25 0.8299 5.325 0.8373 84.469 0.8367 22.463 93.70% 76.30% 73.41% 0.89% 0.81%

25 40 0.6000 23.187 0.6048 377.104 0.6028 96.961 93.85% 76.09% 74.29% 0.79% 0.47%
45 0.5320 36.523 0.5334 484.005 0.5329 123.667 92.45% 70.47% 74.45% 0.25% 0.16%
50 0.4537 36.300 0.4553 606.927 0.4565 161.550 94.02% 77.53% 73.38% 0.35% 0.61%
55 0.3732 57.156 0.3753 720.068 0.3726 195.631 92.06% 70.78% 72.83% 0.58% −0.14%
60 0.2866 157.777 0.2886 795.438 0.2860 217.155 80.16% 27.34% 72.70% 0.71% −0.19%

Average91.42%67.51%73.71%0.49%0.27%