Laxity-based process allocation algorithms to reduce power consumptions in peer-to-peer overlay networks

Authors:
Ailixier Aikebaier;Tomoya Enokido;Makoto Takizawa
Affiliations:
Seikei University, Kichijoji-kitamachi, Musashino-shi, Tokyo, Japan;Seikei University, Osaki, Shinagawa, Tokyo, Japan;Seikei University, Kichijoji-kitamachi, Musashino-shi, Tokyo, Japan
Venue:
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Year:
2009

Citing 7
Cited 0

Cluster reserves: a mechanism for resource management in cluster-based network servers

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analytical and experimental evaluation of cluster-based network servers

World Wide Web
Dynamic Load Balancing in Geographically Distributed Heterogeneous Web Servers

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
A Robust Protocol for Building Superpeer Overlay Topologies

P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Power and Energy Management for Server Systems

Computer
Energy conservation in heterogeneous server clusters

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
On evaluating request-distribution schemes for saving energy in server clusters

ISPASS '03 Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Information systems are composed of various types of computers interconnected in networks. In addition, information systems are being shifted from the traditional client-server model to the peer-to-peer (P2P) model. The P2P systems are scalable and fully distributed without any centralized coordination. It is getting more significant to discuss how to reduce the total electric power consumption of computers in information systems in addition to developing distributed algorithms to minimize the computation time. In this paper, we do not discuss the micro level like the hardware specification of each computer. We discuss a model to show the relation of the computation and the total power consumption of multiple peer computers to perform Web types of processes at macro level. We also discuss algorithms for allocating a process to a computer so that the deadline constraint is satisfied and the total power consumption is reduced.