Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor

Figure 1

Greedy algorithm cannot obtain the optimal solution, where the distance constraint, 𝑞(𝑢), is 8. The number of replica servers is 3.