Process Allocation Algorithms for Saving Power Consumption in Peer-to-Peer Systems
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. P2P systems are scalable and fully distributed without any centralized coordinator....
Gespeichert in:
Veröffentlicht in: | IEEE transactions on industrial electronics (1982) 2011-06, Vol.58 (6), p.2097-2105 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. P2P systems are scalable and fully distributed without any centralized coordinator. Here, it is getting more significant to discuss how to reduce the total electric power consumption of computers in addition to developing distributed algorithms to minimize the computation time and memory space. In this paper, we do not discuss microlevel models like the hardware specifications of computers like low-energy CPUs. We rather discuss a macrolevel model to show the relation of the amount of computation and the total power consumption of multiple peer computers to perform Web types of application processes. 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. |
---|---|
ISSN: | 0278-0046 1557-9948 |
DOI: | 10.1109/TIE.2010.2060453 |