ACM Home Page
Please provide us with feedback. Feedback
Energy conservation techniques for disk array-based servers
Full text PdfPdf (174 KB)
Source
International Conference on Supercomputing archive
Proceedings of the 18th annual international conference on Supercomputing table of contents
Malo, France
SESSION: Input/Output table of contents
Pages: 68 - 78  
Year of Publication: 2004
ISBN:1-58113-839-3
Authors
Eduardo Pinheiro  Rutgers University, Piscataway, NJ
Ricardo Bianchini  Rutgers University, Piscataway, NJ
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 109,   Citation Count: 30
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1006209.1006220
What is a DOI?

ABSTRACT

In this paper, we study energy conservation techniques for disk array-based network servers. First, we introduce a new conservation technique, called Popular Data Concentration (PDC), that migrates frequently accessed data to a subset of the disks. The goal is to skew the load towards a few of the disks, so that others can be transitioned to low-power modes. Next, we introduce a user-level file server that takes advantage of PDC. In the context of this server, we compare PDC to the Massive Array of Idle Disks (MAID). Using a validated simulator, we evaluate these techniques for conventional and two-speed disks and a wide range of parameters. Our results for conventional disks show that PDC and MAID can only conserve energy when the load on the server is extremely low. When two-speed disks are used, both PDC and MAID can conserve significant energy with only a small fraction of delayed requests. Overall, we find that PDC achieves more consistent and robust energy savings than MAID.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Bianchini and R. Rajamony. Power and Energy Management for Server Systems. Technical Report DCS-TR-528, Department of Computer Science, Rutgers University, June 2003.
 
2
 
3
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web Caching and Zipf-like Distributions: Evidence and Implications. In Proceedings of IEEE InfoCom'99, March 1999.
 
4
5
6
 
7
 
8
E. N. Elnozahy, M. Kistler, and R. Rajamony. Energy-Efficient Server Clusters. In Proceedings of the 2nd Workshop on Power-Aware Computing Systems, February 2002.
 
9
M. Elnozahy, M. Kistler, and R. Rajamony. Energy Conservation Policies for Web Servers. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, March 2003.
10
 
11
S. Gurumurthi, J. Zhang, A. Sivasubramaniam, M. Kandemir, H. Franke, N. Vijaykrishnan, and M. J. Irwin. Interplay of Energy and Performance for Disk Arrays Running Transaction Processing Workloads. In Proceedings of the International Symposium on Performance Analysis of Systems and Software, March 2003.
 
12
T. Heath, B. Diniz, E. V. Carrera, W. Meira Jr., and R. Bianchini. Self-Configuring Heterogeneous Server Clusters. In Proceedings of the Workshop on Compilers and Operating Systems for Low Power, September 2003.
13
 
14
 
15
A. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1):79--119, 1988.
 
16
K. Okada, N. Kojima, and K. Yamashita. A Novel Drive Architecture of HDD: "Multimode Hard Disk Drive". In Proceedings of the International Conference on Consumer Electronics, June 2000.
 
17
E. Pinheiro and R. Bianchini. A Power-Aware Cluster-Based File System. Work-in-Progress Session, 18th Symposium on Operating Systems Principles. October, 2001.
 
18
 
19
 
20
21

CITED BY  31

Collaborative Colleagues:
Eduardo Pinheiro: colleagues
Ricardo Bianchini: colleagues