The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Hibernator: helping disk arrays sleep through the winter
Abstract
Energy consumption has become an important issue in high-end data centers, and disk arrays are one of the largest energy consumers within them. Although several attempts have been made to improve disk array energy management, the existing solutions either provide little energy savings or significantly degrade performance for data center workloads.Our solution, Hibernator, is a disk array energy management system that provides improved energy savings while meeting performance goals. Hibernator combines a number of techniques to achieve this: the use of disks that can spin at different speeds, a coarse-grained approach for dynamically deciding which disks should spin at which speeds, efficient ways to migrate the right data to an appropriate-speed disk automatically, and automatic performance boosts if there is a risk that performance goals might not be met due to disk energy management.In this paper, we describe the Hibernator design, and present evaluations of it using both trace-driven simulations and a hybrid system comprised of a real database server (IBM DB2) and an emulated storage server with multi-speed disks. Our file-system and on-line transaction processing (OLTP) simulation results show that Hibernator can provide up to 65% energy savings while continuing to satisfy performance goals (6.5--26 times better than previous solutions). Our OLTP emulated system results show that Hibernator can save more energy (29%) than previous solutions, while still providing an OLTP transaction rate comparable to a RAID5 array with no energy management.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
RAID: high-performance, reliable secondary storage
Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., & Patterson, D. A. (1994) · ACM Computing Surveys · doi:10.1145/176979.176981 · Cited by 1,198
Managing server energy and operational costs in hosting centers
Chen, Y., Das, A., Qin, W., Sivasubramaniam, A., Wang, Q., & Gautam, N. (2005) · Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1064212.1064253 · Cited by 556
Ruemmler, C., & Wilkes, J. (1993) · USENIX Winter · Cited by 428
Self-citationEnergy conservation techniques for disk array-based servers
Pinheiro, E., & Bianchini, R. (2004) · International Conference on Supercomputing · doi:10.1145/1006209.1006220 · Cited by 346
Massive Arrays of Idle Disks for Storage Archives
Colarelli, D., & Grunwald, D. C. (2002) · Cited by 339
Adaptive Disk Spin-Down Policies for Mobile Computers.
Douglis, F., & Krishnan, P. (1995) · Cited by 334
Conserving disk energy in network servers
Carrera, E. V., Pinheiro, E., & Bianchini, R. (2003) · International Conference on Supercomputing · doi:10.1145/782814.782829 · Cited by 321
Golding, R. A., Bösch, P., Staelin, C., Sullivan, T., & Wilkes, J. (1995) · USENIX Annual Technical Conference · Cited by 264
Self-citationHippodrome: running circles around storage administration
Anderson, E. J., Hobbs, M., Keeton, K., Spence, S., Uysal, M., & Veitch, A. (2002) · Cited by 235
Self-citationAdaptive disk spin‐down for mobile computers
Helmbold, D. P., Long, D. D. E., Sconyers, T. L., & Sherrod, B. (2000) · Mobile Networks and Applications · doi:10.1023/a:1019129116852 · Cited by 116
Performance directed energy management for main memory and disks
Li, X., Li, Z., David, F. M., Zhou, P., Zhou, Y., Adve, S. V., & Kumar, S. (2004) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/1024393.1024425 · Cited by 104
Self-citationProgram Counter Based Techniques for Dynamic Power Management
Gniady, C., Hu, Y., & Lu, Y.-H. (2005) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2004.10021 · Cited by 46
Cited by
Data Center Energy Consumption Modeling: A Survey
Dayarathna, M., Wen, Y., & Fan, R. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2481183 · Cited by 1,165
Write off-loading: Practical power management for enterprise storage
Narayanan, D., Donnelly, A., & Rowstron, A. (2008) · ACM Transactions on Storage · doi:10.1145/1416944.1416949 · Cited by 762
VirtualPower: coordinated power management in virtualized enterprise systems
Nathuji, R., & Schwan, K. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294287 · Cited by 606
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
Self-citationOptimizing energy consumption for data centers
Rong, H., Zhang, H., Xiao, S., Li, C., & Hu, C. (2016) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.12.283 · Cited by 398
Metadata
- Authors
- Zhu, Q., Chen, Z., Tan, L., Zhou, Y., Keeton, K., & Wilkes, J.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2005-10-20
- Volume
- 39
- Issue
- 5
- Pages
- 177-190
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2171299219
- Cited by
- 287
- References
- 14
- FWCI
- 28.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.