The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2010 vol.59)
pp: 345-357
Weimin Zheng , Tsinghua University, Beijing
Guangyan Zhang , Tsinghua University, Beijing
ABSTRACT
When a RAID-5 volume is scaled up with added disks, data have to be redistributed from original disks to all disks including the original and the new. Existing online scaling techniques suffer from long redistribution times as well as negative impacts on application performance. By leveraging our insight into a reordering window, this paper presents ALV, a new data redistribution approach to RAID-5 scaling. The reordering window is a result of the natural space hole as data being redistributed, and it grows in size. The data inside the reordering window can migrate in any order without overwriting other in-use data chunks. The ALV approach exploits three novel techniques. First, ALV changes the movement order of data chunks to access multiple successive chunks via a single I/O. Second, ALV updates mapping metadata lazily to minimize the number of metadata writes while ensuring data consistency. Third, ALV uses an on/off logical valve to adaptively adjust the redistribution rate depending on application workload. We implemented ALV in Linux Kernel 2.6.18 and evaluated its performance by replaying three real-system traces: TPC-C, Cello-99, and SPC-Web. The results demonstrated that ALV outperformed the conventional approach consistently by 53.31-73.91 percent in user response time and by 24.07-29.27 percent in redistribution time.
INDEX TERMS
RAID-5 scaling, reordering window, I/O aggregation, lazy checkpoint, rate control.
CITATION
Weimin Zheng, Guangyan Zhang, "ALV: A New Data Redistribution Approach to RAID-5 Scaling", IEEE Transactions on Computers, vol.59, no. 3, pp. 345-357, March 2010, doi:10.1109/TC.2009.150
REFERENCES
[1] D. Patterson, “A Simple Way to Estimate the Cost of Downtime,” Proc. 16th Large Installation Systems Administration Conf. (LISA '02), pp. 185-188, Oct. 2002.
[2] J. Gonzalez and T. Cortes, “Increasing the Capacity of RAID5 by Online Gradual Assimilation,” Proc. Int'l Workshop Storage Network Architecture and Parallel I/Os, Sept. 2004.
[3] N. Brown, “Online RAID-5 Resizing. Drivers/md/Raid5.c in the Source Code of Linux Kernel 2.6.18,” http:/www.kernel.org/, Sept. 2006.
[4] M. Wachs, M. Abd-El-Malek, E. Thereska, and G. Ganger, “Argon: Performance Insulation for Shared Storage Servers,” Proc. Fifth USENIX Conf. File and Storage Technologies (FAST '07), Feb. 2007.
[5] S. Gribble, G. Manku, E. Roselli, and E. Brewer, “Self-Similarity in File Systems,” Proc. SIGMETRICS '98, pp. 141-150, Apr. 1998.
[6] G. Zhang, J. Shu, W. Xue, and W. Zheng, “SLAS: An Efficient Approach to Scaling Round-Robin Striped Volumes,” ACM Trans. Storage , vol. 3, no. 1, pp. 1-39, Mar. 2007.
[7] H. Jin, X. Zhou, D. Feng, and J. Zhang, “Improving Partial Stripe Write Performance in RAID Level 5,” Proc. Second IEEE Int'l Caracas Conf. Devices, Circuits and Systems (ICCDCS '98), pp. 396-400, Mar. 1998.
[8] A. Kuratti and W.H. Sanders, “Performance Analysis of the RAID 5 Disk Array,” Proc. Int'l Computer Performance and Dependability Symp., pp. 236-245, Apr. 1995.
[9] E. Lee and R. Katz, “The Performance of Parity Placements in Disk Arrays,” IEEE Trans. Computers, vol. 42, no. 6, pp. 651-664, June 1993.
[10] C. Kim, G. Kim, and B. Shin, “Volume Management in SAN Environment,” Proc. Eighth Int'l Conf. Parallel and Distributed Systems (ICPADS '01), pp. 500-505, 2001.
[11] P. Chen and E. Lee, “Striping in a RAID Level 5 Disk Array,” Proc. ACM SIGMETRICS Conf. Measurement and Modeling of Computer Systems, May 1995.
[12] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach, third ed. Morgan Kaufmann Publishers, Inc., 2003.
[13] J. Wilkes, R. Golding, C. Staelin, and T. Sullivan, “The HP AutoRAID Hierarchical Storage System,” ACM Trans. Computer Systems, vol. 14, no. 1, pp. 108-136, Feb. 1996.
[14] D. Stodolsky, G. Gibson, and M. Holland, “Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays,” Proc. 20th Ann. Int'l Symp. Computer Architecture (ISCA '93), pp. 64-75, 1993.
[15] A. Verma, U. Sharma, J. Rubas, D. Pease, M. Kaplan, R. Jain, M. Devarakonda, and M. Beigi, “An Architecture for Lifecycle Management in Very Large File Systems,” Proc. 22nd IEEE-13th NASA Goddard Conf. Mass Storage Systems and Technology (MSST '05), Apr. 2005.
[16] C. Lu, G. Alvarez, and J. Wilkes, “Aqueduct: Online Data Migration with Performance Guarantees,” Proc. First USENIX Conf. File and Storage Technologies (FAST '02), pp. 219-230, 2002.
[17] Performance Evaluation Laboratory, Trace Distribution Center, Brigham Young Univ., http://tds.cs.byu.edutds/, 2002.
[18] Public Software, Storage Systems Dept. at HP Labs, http://tesla.hpl.hp.compublic_software/, 2009.
[19] Storage Networking Industry Assoc., http:/www.snia.org, 2009.
[20] L. Tian, D. Feng, H. Jiang, K. Zhou, L. Zeng, J. Chen, Z. Wang, and Z. Song, “PRO: A Popularity-Based Multi-Threaded Reconstruction Optimization for RAID-Structured Storage Systems,” Proc. Fifth USENIX Conf. File and Storage Technologies (FAST '07), pp.277-290, Feb. 2007.
[21] S. Jiang, X. Ding, F. Chen, E. Tan, and X. Zhang, “DULO: An Effective Buffer Cache Management Scheme to Exploit Both Temporal and Spatial Locality,” Proc. USENIX Conf. File and Storage Technologies (FAST '05), Dec. 2005.
[22] C.B. Legg, “Method of Increasing the Storage Capacity of a Level Five RAID Disk Array by Adding, in a Single Step, a New Parity Block and N-1 New Data Blocks Which Respectively Reside in a New Columns, Where N Is at Least Two Document Type and Number,” US Patent: 6000010, 1999.
[23] C.R Franklin and J.T. Wong, “Expansion of RAID Subsystems Using Spare Space with Immediate Access to New Space,” US Patent 10/033,997, 2006.
[24] S.R. Hetzler, “Data Storage Array Scaling Method and System with Minimal Data Movement,” US Patent 20080276057, 2008.
[25] M. Sivathanu, V. Prabhakaran, A.C. Arpaci-Dusseau, and R.H. Arpaci-Dusseau, “Improving Storage System Availability with D-GRAID,” Proc. Third USENIX Conf. File and Storage Technologies, Mar. 2004.
[26] M. Holland, G. Gibson, and D. Siewiorek, “Architectures and Algorithms for On-Line Failure Recovery in Redundant Disk Arrays,” Distributed and Parallel Databases, vol. 11, no. 3, pp. 295-335, July 1994.
[27] J. Douceur and W. Bolosky, “Progress-Based Regulation of Low-Importance Processes,” Proc. 17th ACM Symp. Operating Systems Principles (SOSP '99), pp. 247-260, Dec. 1999.
[28] A. Thomasian and J. Menon, “RAID5 Performance with Distributed Sparing,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 6, pp. 640-657, June 1997.
[29] G. Fu, A. Thomasian, C. Han, and S. Ng, “Rebuild Strategies for Redundant Disk Arrays,” Proc. Conf. Mass Storage Systems and Technologies (MSST '04), Apr. 2004.
[30] R. Hou, J. Menon, and Y. Patt, “Balancing I/O Response Time and Disk Rebuild Time in a RAID5 Disk Array,” Proc. Hawaii Int'l Conf. System Sciences, pp. 70-79, 1993.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool