Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="707592.fig.006a" src="https://static.hindawi.com/articles/jcnc/volume-2011/707592/figures/707592.fig.006a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Replication strategy {0,1,5} covers all servers</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="707592.fig.006b" src="https://static.hindawi.com/articles/jcnc/volume-2011/707592/figures/707592.fig.006b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Replication strategy {0,3,7} does not cover all servers</td></tr></table></td></tr></table>

<table>The cover inspection of replication strategies satisfying cost 8.</table>

Journal of Computer Networks and Communications

fig6

Figure 6

Figure 6: Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor 