Skip to main content

Improved Redundant Power Consumption Laxity-Based Algorithm for Server Clusters

  • Conference paper
  • First Online:
Information Technology Convergence

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 253))

  • 1059 Accesses

Abstract

A client usually issues a request to one server in a cluster of servers and the server sends a reply to the client. Once the server stops by fault, the client is suspended to wait for a reply. In order to be tolerant of server faults, each request is redundantly performed on multiple servers. Here, the more number of servers a request process is redundantly performed, the more reliable but the more amount of electric energy is consumed. Thus, it is critical to discuss how to realize energy-aware, robust clusters of servers. In this paper, we newly propose the improved redundant power consumption laxity-based (IRPCLB) algorithm where once a process successfully terminates on one server, meaningless redundant processes are not performed on the other servers. We show the total power consumption of servers is reduced in the IRPCLB algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hemmert S (2010) Green HPC: from nice to necessity. In: Proceeding of the computing in science and engineering, pp 8–10

    Google Scholar 

  2. Lamport R, Shostak R, Pease M (1982) The Byzantine generals problems. ACM Trans Program Lang Syst 4(3):382–401

    Google Scholar 

  3. Enokido T, Aikebaier A, Takizawa M (2010) A model for reducing power consumption in peer-to-peer systems. IEEE Syst J 4(2):221–229

    Article  Google Scholar 

  4. Enokido T, Aikebaier A, Takizawa M (2011) Process allocation algorithms for saving power consumption in peer-to-peer systems. IEEE Trans Ind Electron 58(6):2097–2105

    Article  Google Scholar 

  5. Enokido T, Takizawa M (2012) Energy-efficient server selection algorithms based on the extended simple power consumption model. In: Proceedings of the 6th international conference on complex, intelligent and software intensive systems (CISIS-2012), pp 276–283

    Google Scholar 

  6. Enokido T, Aikebaier A, Takizawa M (2012) A redundant power consumption laxity-based (RPCLB) algorithm for computation type applications. In: Proceedings of the 14th international symposium on multimedia network systems and applications (MNSA-2012), pp 562–567

    Google Scholar 

  7. Job Scheduling Algorithms in Linux Virtual Server, http://www.linuxvirtualserver.org/docs/ scheduling.html

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tomoya Enokido .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Enokido, T., Aikebaier, A., Takizawa, M. (2013). Improved Redundant Power Consumption Laxity-Based Algorithm for Server Clusters. In: Park, J., Barolli, L., Xhafa, F., Jeong, HY. (eds) Information Technology Convergence. Lecture Notes in Electrical Engineering, vol 253. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6996-0_43

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-6996-0_43

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-6995-3

  • Online ISBN: 978-94-007-6996-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics