research-article

An approach to reduce the energy cost of the arbitrary tree replication protocol

Authors:

Robert Basmadjian,

Hermann de MeerAuthors Info & Claims

e-Energy '10: Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking

Pages 151 - 158

https://doi.org/10.1145/1791314.1791338

Published: 13 April 2010 Publication History

Abstract

Until recently, there have been no efforts of devising energy-efficient replication protocols for large-scale distributed systems. In this paper, we introduce an approach that reduces the energy cost of a particular tree-structured replication protocol. We show that, by shutting down some replicas and by a simple logical structural transformation (rearrangement), our approach achieves comparable characteristics as the original protocol, yet with much reduced energy cost as well as overall energy consumption. The logical transformation does not necessitate the reconfiguration of the protocol whenever energy efficiency requirements change.

References

[1]

D. Agrawal and A. E. Abbadi. The tree quorum protocol: An efficient approach for managing replicated data. In Proceedings of the sixteenth international conference on Very Large Databases, pages 243--254, 1990.

Digital Library

[2]

D. Agrawal and A. E. Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems, 9(1):1--20, 1991.

Digital Library

[3]

J. P. Bahsoun, R. Basmadjian, and R. Guerraoui. An arbitrary tree structured replica control protocol. The 28th International Conference on Distributed Computing Systems, pages 502--511, 2008.

Digital Library

[4]

P. Bernstein and N. Goodman. An algorithm for concurrency control and recovery in replicated distributed databases. ACM Transactions on Database Systems, 9(4):596--615, 1984.

Digital Library

[5]

J. S. Chase, D. C. Anderson, P. N. Thakar, A. M. Vahdat, and R. P. Doyle. Managing energy and server resources in hosting centers. ACM SIGOPS Operating Systems Review, 35(5):103--116, 2001.

Digital Library

[6]

S. Y. Cheung, M. H. Ammar, and M. Ahamad. The grid protocol: A high performance scheme for maintaining replicated data. IEEE Transactions on Knowledge and Data Engineering, 4(6):438--445, 1990.

Digital Library

[7]

S. C. Choi, H. Y. Youn, and J. S. Choi. Symmetric tree replication protocol for efficient distributed storage system. International Conference on Computational Science, pages 474--484, 2003.

Digital Library

[8]

T. Heath, A. P. Centeno, P. George, L. E. S. Ramos, Y. Jaluria, and R. G. Bianchini. Mercury and freon: temperature emulation and management for server systems. In Proceedings of the 12th international conference on Architectural support for programming languages and operating systems, pages 106--116, 2006.

Digital Library

[9]

K. H. Kim, R. Buyya, and J. Kim. Power aware scheduling of bag-of-tasks applications with deadline constraints on dvs-enabled clusters. In Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid, pages 541--548, 2007.

Digital Library

[10]

H. Koch. An efficient replication protocol exploiting logical tree structures. The 23rd Annual International Symposium on Fault-Tolerant Computing, pages 382--391, 1993.

[11]

A. Kumar. Hierarchical quorum consensus: A new algorithm for managing replicated data. IEEE Transactions on Computers, 40(9):996--1004, 1991.

Digital Library

[12]

M. Maekawa. A √n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, May 1985.

Digital Library

[13]

M. Naor and A. Wool. The load, capacity, and availability of quorum systems. SIAM Journal on Computing, 27:214--225, 1998.

Digital Library

[14]

D. Peleg and A. Wool. The availability of quorum systems. Information and Computation, 123(2):210--223, 1995.

Digital Library

[15]

E. Pinheiro, R. Bianchini, E. V. Carrera, and T. Heath. Dynamic cluster reconfiguration for power and performance. In Compilers and operating systems for low power, pages 75--93, 2003.

Digital Library

[16]

C. Seo, G. Edwards, D. Popescu, S. Malek, and N. Medvidovic. A framework for estimating the energy consumption induced by a distributed system's architectural style. In Proceedings of the 8th international workshop on Specifcation and verification of component-based systems, 2009.

Digital Library

[17]

A. Silberschartz, H. F. Korth, and S. Sudarshan. Database System Concepts. McGraw-Hill, fourth edition, 2002.

[18]

R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180--209, June 1979.

Digital Library

[19]

N. Vasic, M. Barisits, V. Salzgeber, and D. M. Kostic. Making cluster applications energy-aware. In Proceedings of the 1st workshop on Automated control for data centers and clouds, pages 37--42, 2009.

Digital Library

Cited By

Ozkasap OCem EEfsun Cebeci SKoc T(2014)Flat and hierarchical epidemics in P2P systems: Energy cost models and analysisFuture Generation Computer Systems10.1016/j.future.2013.09.00936(257-266)Online publication date: Jul-2014
https://doi.org/10.1016/j.future.2013.09.009
Cem EKoc TOzkasap O(2011)Energy efficient hierarchical epidemics in peer-to-peer systems2011 International Conference on Energy Aware Computing10.1109/ICEAC.2011.6136685(1-5)Online publication date: Nov-2011
https://doi.org/10.1109/ICEAC.2011.6136685
Cem EDemirkaya EEsiner EOzaydin BOzkasap O(2011)Energy Cost Model for Frequent Item Set Discovery in Unstructured P2P NetworksComputer and Information Sciences II10.1007/978-1-4471-2155-8_14(117-123)Online publication date: 29-Sep-2011
https://doi.org/10.1007/978-1-4471-2155-8_14

Index Terms

An approach to reduce the energy cost of the arbitrary tree replication protocol

Recommendations

Signed quorum systems
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum systems. However, even this optimal construction requires (n+1)/2 functioning servers ...
Assessing data deduplication trade-offs from an energy and performance perspective
IGCC '11: Proceedings of the 2011 International Green Computing Conference and Workshops

The energy costs of running computer systems are a growing concern: for large data centers, recent estimates put these costs higher than the cost of hardware itself. As a consequence, energy efficiency has become a pervasive theme for designing, ...
The Load and Availability of Byzantine Quorum Systems

Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

e-Energy '10: Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking

April 2010

239 pages

ISBN:9781450300421

DOI:10.1145/1791314

General Chairs:
Randy Katz
UC Berkeley
,
David Hutchison
Lancaster University, U.K.

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

IFIP TC6
University of Passau

In-Cooperation

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 April 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Seventh Framework Programme

Conference

e-Energy '10

Sponsor:

e-Energy '10: 1st Int'l Conf. on Energy-Efficient Computing and Networking

April 13 - 15, 2010

Passau, Germany

Acceptance Rates

Overall Acceptance Rate 160 of 446 submissions, 36%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
136
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ozkasap OCem EEfsun Cebeci SKoc T(2014)Flat and hierarchical epidemics in P2P systems: Energy cost models and analysisFuture Generation Computer Systems10.1016/j.future.2013.09.00936(257-266)Online publication date: Jul-2014
https://doi.org/10.1016/j.future.2013.09.009
Cem EKoc TOzkasap O(2011)Energy efficient hierarchical epidemics in peer-to-peer systems2011 International Conference on Energy Aware Computing10.1109/ICEAC.2011.6136685(1-5)Online publication date: Nov-2011
https://doi.org/10.1109/ICEAC.2011.6136685
Cem EDemirkaya EEsiner EOzaydin BOzkasap O(2011)Energy Cost Model for Frequent Item Set Discovery in Unstructured P2P NetworksComputer and Information Sciences II10.1007/978-1-4471-2155-8_14(117-123)Online publication date: 29-Sep-2011
https://doi.org/10.1007/978-1-4471-2155-8_14

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten