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

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="151394.fig.001a" src="https://static.hindawi.com/articles/mpe/volume-2014/151394/figures/151394.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>A distributed system</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="151394.fig.001b" src="https://static.hindawi.com/articles/mpe/volume-2014/151394/figures/151394.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>A task graph</td></tr></table></td></tr></table>

<table>Results of the evaluation.</table>

Mathematical Problems in Engineering

fig1

Figure 1

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