Power-Aware Replica Placement in Tree Networks with Multiple Servers per Client

  • Guillaume Aupy
  • Anne Benoit
  • Matthieu Journault
  • Yves Robert
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8632)

Abstract

In this paper, we revisit the well-studied problem of replica placement in tree networks. Rather than minimizing the number of servers needed to serve all client requests, we aim at minimizing the total power consumed by these servers. In addition, we use the most general (and powerful) server assignment policy, where the requests of a client can be served by multiple servers located in the (unique) path from this client to the root of the tree. We consider multi-modal servers that can operate at a set of discrete speeds, using the dynamic voltage and frequency scaling (DVFS) technique. The optimization problem is to determine an optimal location of the servers in the tree, as well as the speed at which each server is operated. A major result is the NP-completeness of this problem, to be contrasted with the minimization of the number of servers, which has polynomial complexity. Another important contribution is the formulation of a Mixed Integer Linear Program (MILP) for the problem, together with the design of several polynomial-time heuristics. We assess the efficiency of these heuristics by simulation. For mid-size instances (up to 30 nodes in the tree), we evaluate their absolute performance by comparison with the optimal solution (obtained via the MILP). The most efficient heuristics provide satisfactory results, within 20% of the optimal solution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aupy, G., Benoit, A., Journault, M., Robert, Y.: Power-aware replica placement in tree networks with multiple servers per client. Research Report 8474, INRIA (February 2014), http://graal.ens-lyon.fr/~abenoit/
  2. 2.
    Aupy, G., Journault, M.: Source code for the simulations, https://github.com/Gaupy/replica
  3. 3.
    Benoit, A., Rehn-Sonigo, V., Robert, Y.: Replica placement and access policies in tree networks. IEEE Trans. Parallel and Distributed Systems 19(12), 1614–1627 (2008)CrossRefGoogle Scholar
  4. 4.
    Benoit, A., Renaud-Goud, P., Robert, Y.: Power-aware replica placement and update strategies in tree networks. In: Proceedings of the 25th IEEE Int. Parallel and Distributed Processing Symposium, IPDPS 2011 (May 2011)Google Scholar
  5. 5.
    Chandrakasan, A.P., Sinha, A.: Jouletrack: A web based tool for software energy profiling. In: Design Automation Conference. IEEE, pp. 220–225 (2001)Google Scholar
  6. 6.
    Chen, J.J., Kuo, T.W.: Multiprocessor energy-efficient scheduling for real-time tasks. In: Proceedings of Int. Conf. on Parallel Proc (ICPP), pp. 13–20. IEEE (2005)Google Scholar
  7. 7.
    Chen, J.J.: Expected energy consumption minimization in DVS systems with discrete frequencies. In: Proc. of SAC 2008, Symp. on Applied Computing, pp. 1720–1725 (2008)Google Scholar
  8. 8.
    Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. Computer Networks 40, 205–218 (2002)CrossRefGoogle Scholar
  9. 9.
    Cplex: ILOG CPLEX: High-performance software for mathematical programming and optimization, http://www.ilog.com/products/cplex/
  10. 10.
    Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)Google Scholar
  11. 11.
    Hotta, Y., Sato, M., Kimura, H., Matsuoka, S., Boku, T., Takahashi, D.: Profile-based optimization of power performance by using dynamic voltage scaling on a PC cluster. In: The IEEE Int. Parallel and Distributed Processing Symposium Proceedings of IPDPS (2006)Google Scholar
  12. 12.
    Kalpakis, K., Dasgupta, K., Wolfson, O.: Optimal placement of replicas in trees with read, write, and storage costs. IEEE Trans. Parallel and Distributed Systems 12(6), 628–637 (2001)CrossRefGoogle Scholar
  13. 13.
    Larabel, M.: Intel EIST SpeedStepGoogle Scholar
  14. 14.
    Liu, P., Lin, Y.F., Wu, J.J.: Optimal placement of replicas in data grid environments with locality assurance. In: Int. Conf. on Parallel and Distr. Syst. (2006)Google Scholar
  15. 15.
    Loukopoulos, T., Ahmad, I., Papadias, D.: An overview of data replication on the Internet. In: Proc. Int. Symp. on Parallel Architectures, Algorithms and Networks ISPAN 2002. IEEE Computer Society Press (2002)Google Scholar
  16. 16.
    Mills, M.P.: The internet begins with coal. Environment and Climate News (1999)Google Scholar
  17. 17.
    Niu, L.: Energy Efficient Scheduling for Real-Time Embedded Systems with QoS Guarantee. In: Proc. of RTCSA, the 16th Int. Conf. on Embedded and Real-Time Computing Systems and App., 163 –172 (August 2010)Google Scholar
  18. 18.
    Pruhs, K., van Stee, R., Uthaisombut, P.: Speed scaling of tasks with precedence constraints. Theory of Computing Systems 43, 67–80 (2008)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Shi, B., Srivastava, A.: Thermal and Power-Aware Task Scheduling and Data Placement for Storage Centric Datacenters. In: Ranka, S., Ahmad, I. (eds.) Handbook of Energy-Aware and Green Computing, vol. 1, CRC Press (2012)Google Scholar
  20. 20.
    Wu, J.J., Lin, Y.F., Liu, P.: Optimal replica placement in hierarchical Data Grids with locality assurance. J. Parallel and Distributed Computing 68(12), 1517–1538 (2008)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Guillaume Aupy
    • 1
  • Anne Benoit
    • 1
  • Matthieu Journault
    • 1
  • Yves Robert
    • 1
    • 2
  1. 1.École Normale Supérieure de LyonCNRS & INRIAFrance
  2. 2.University of Tennessee KnoxvilleUSA

Personalised recommendations