| DARAW: a new write buffer to improve parallel I/O energy-efficiency |
| Full text |
Pdf
(376 KB)
|
Source
|
Symposium on Applied Computing
archive
Proceedings of the 2009 ACM symposium on Applied Computing
table of contents
Honolulu, Hawaii
SESSION: Operating systems track
table of contents
Pages 299-304
Year of Publication: 2009
ISBN:978-1-60558-166-8
|
|
Authors
|
|
Xiaojun Ruan
|
Auburn University, Auburn, AL
|
|
Adam Manzanares
|
Auburn University, Auburn, AL
|
|
Kiranmai Bellam
|
Auburn University, Auburn, AL
|
|
Xiao Qin
|
Auburn University, Auburn, AL
|
|
Ziliang Zong
|
South Dakota School of Mines and Technology, Rapid City, SD
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 18, Downloads (12 Months): 46, Citation Count: 0
|
|
|
ABSTRACT
In the past decades, parallel I/O systems have been used widely to support scientific and commercial applications. New data centers today employ huge quantities of I/O systems, which consume a large amount of energy. Most large-scale I/O systems have an array of hard disks working in parallel to meet performance requirements. Traditional energy conservation techniques attempt to place disks into low-power states when possible. In this paper we propose a novel strategy, which aims to significantly conserve energy while reducing average I/O response times. This goal is achieved by making use of buffer disks in parallel I/O systems to accumulate small writes to form a log, which can be transferred to data disks in a batch way. We develop an algorithm - dynamic request allocation algorithm for writes or DARAW - to energy efficiently allocate and schedule write requests in a parallel I/O system. DARAW is able to improve parallel I/O energy efficiency by the virtue of leveraging buffer disks to serve a majority of incoming write requests, thereby keeping data disks in low-power state for longer period times. Buffered requests are then written to data disks at a predetermined time. Experimental results show that DARAW can significantly reduce energy dissipation in parallel I/O systems without adverse impacts on I/O performance.
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
|
|
| |
2
|
|
| |
3
|
P. Goyal, D. Jadav, D. S. Modha, and R. Tewari, "CacheCOW: Qos for Storage System Caches," Proc. Int'l Workshop QoS, 2003
|
| |
4
|
J. C. Chuang and M. A. Sirbu, "Distributed Network Storage Service with Quality-of Service Guarantees," Proc. Conf. Internet Society INET'99, June 1999.
|
| |
5
|
Z. Zong, M. Briggs, N. O'Connor, and X. Qin, "An Energy-Efficient Framework for Large-Scale Parallel Storage Systems," Proc. Int'l Conf. Parallel and Distributed Processing Symp., Mar. 2007.
|
| |
6
|
|
| |
7
|
S. Lakshmanan, M. Ahamad, and H. Venkateswaran, "Responsive Security for Stored Data," IEEE Trans. Parallel and Distr. Sys., vol. 14, no. 9, Sep. 2003.
|
| |
8
|
M. I. Lutwyche and M. Despont, et al, "Highly Parallel Data Storage System Based on Scanning Probe Arrays," American Institute of Physics, 2000.
|
| |
9
|
|
| |
10
|
H. Zhang, W. Wu, X. Dong, D. Qian and L. Dai, "A Study on Data Placement of Extensible Parallel Storage System," Proc. Int'l Conf. Computer and Information Science, 2007.
|
| |
11
|
|
| |
12
|
|
 |
13
|
Rakesh Barve , Mahesh Kallahalla , Peter J. Varman , Jeffrey Scott Vitter, Competitive parallel disk prefetching and buffer management, Proceedings of the fifth workshop on I/O in parallel and distributed systems, p.47-56, November 17-17, 1997, San Jose, California, United States
[doi> 10.1145/266220.266225]
|
| |
14
|
|
| |
15
|
|
 |
16
|
Dean Hildebrand , Lee Ward , Peter Honeyman, Large files, small writes, and pNFS, Proceedings of the 20th annual international conference on Supercomputing, June 28-July 01, 2006, Cairns, Queensland, Australia
[doi> 10.1145/1183401.1183419]
|
| |
17
|
|
| |
18
|
R. Rangaswami, Z. Dimitrijevic, E. Chang and K. Schauser, "MEMS-based Disk Buffer for Streaming Media Servers," Proc. Int'l Conf. Data Eng., 2003.
|
 |
19
|
|
| |
20
|
|
 |
21
|
|
|