Data Allocation in Disk Arrays with Multiple Raid Levels
Total Page：16
File Type：pdf, Size：1020Kb
New Jersey Institute of Technology Digital Commons @ NJIT Dissertations Electronic Theses and Dissertations Spring 5-31-2008 Data allocation in disk arrays with multiple raid levels Jun Xu New Jersey Institute of Technology Follow this and additional works at: https://digitalcommons.njit.edu/dissertations Part of the Computer Sciences Commons Recommended Citation Xu, Jun, "Data allocation in disk arrays with multiple raid levels" (2008). Dissertations. 870. https://digitalcommons.njit.edu/dissertations/870 This Dissertation is brought to you for free and open access by the Electronic Theses and Dissertations at Digital Commons @ NJIT. It has been accepted for inclusion in Dissertations by an authorized administrator of Digital Commons @ NJIT. For more information, please contact [email protected]. Cprht Wrnn & trtn h prht l f th Untd Stt (tl , Untd Stt Cd vrn th n f phtp r thr rprdtn f prhtd trl. Undr rtn ndtn pfd n th l, lbrr nd rhv r thrzd t frnh phtp r thr rprdtn. On f th pfd ndtn tht th phtp r rprdtn nt t b “d fr n prp thr thn prvt td, hlrhp, r rrh. If , r rt fr, r ltr , phtp r rprdtn fr prp n x f “fr tht r b lbl fr prht nfrnnt, h ntttn rrv th rht t rf t pt pn rdr f, n t jdnt, flfllnt f th rdr ld nvlv vltn f prht l. l t: h thr rtn th prht hl th r Inttt f hnl rrv th rht t dtrbt th th r drttn rntn nt: If d nt h t prnt th p, thn lt “ fr: frt p t: lt p n th prnt dl rn h n tn lbrr h rvd f th prnl nfrtn nd ll ntr fr th pprvl p nd brphl th f th nd drttn n rdr t prtt th dntt f I rdt nd flt. ASAC AA AOCAIO I ISK AAYS WI MUIE AI EES y u u ee as ee a eosio i e amou o geeae aa wic as o e soe eiay ecause i is o easiy eoucie Some aases equie eque ea a wie access ike oie asacio ocessig aicaios Oes us ee o e soe saey a ea oce i a wie as i aa miig is iee access equiemes ca e soe y usig e AI (eua aay o ieesie isks aaigm ie AI1 o e is siuaio a AI5 o e seco siuaio uemoe ae a oiig wo isk aays wi AI1 a AI5 caaiiies a cooe ca e osuae o emuae o I is eee as a eeogeeous isk aay (A eicaig a suse o isks o AI1 esus i oo isk uiiaio sice AI1 s AI5 caaciy a awi equiemes ae o kow a ioi aacig isk oas we isk sace is sae amog aocaio equess eee o as iua aays - As oses a iicu oem AI1 isk aays ae a ige access ae e gigaye a AI5 isk aays Aocaig moe As wie keeig isk uiiaios aace a wii acceae ous is e goa o is suy Gie is sie a access ae a As wi o e ume o is iua isks - s is eemie s aocaios o ysica isks usig eco-ackig euisics wi isk caaciy a awi as e wo imesios ae sow o e e es A aocaio is acceae i i oes o ecee e isk caaciy a oeoa isks ee i e esece o isk aiues We isk awi ae a caaciy is e oeeck e cusee AI aaigm is aie wic oes a aeo ewee isk sace a awi Aoe sceaio is aso cosiee wee e AI ee is eemie y a cassiicaio agoim uiiig e access caaceisics o e A ie acios o sma esus age access a e acio o wie esus ea accesses e eec o AI1 ogaiaio o is eiaiiy a eomace is suie oo e eec o isk aiues o e -coe wo isk aiue oea aay is aaye a i is sow a e oa acoss isks is igy uaace uess i a aay gous o sies ae aomy oae 2 AA AOCAIO I ISK AAYS WI MUIE AI EES y u u A isseaio Sumie o e acuy o ew esey Isiue o ecoogy i aia uime o e equiemes o e egee o oco o iosoy i Comue Sciece eame o Comue Sciece May Copyright © 2008 by Jun Xu ALL RIGHTS RESERVED AOA AGE AA AOCAIO I ISK AAYS WI MUIE AI EES n Aeae omasia isseaio Aiso ae hn nd At ai assimi Commiee Meme ae Associae oesso o Comue Sciece I Dr. -Ai Mii Commiee Meme ae oesso o Comue Sciece I Cisia ocea Commiee Meme ae Assisa oesso o Comue Sciece I ia Yag Commiee Meme ae Associae oesso o Iusia a Mauacuig Egieeig I IOGAICA SKEC Auo u u egee oco o iosoy ae May Uegauae a Gauae Eucaio • oco o iosoy i Comue Sciece ew esey Isiue o ecoogy ewak • Mase o Sciece i Comue Sciece owso Uiesiy owso M 1 • MA Uiesiy o aimoe aimoe M 1999 • aceo o A i Ecoomics Sagai Isiue o oeig ae Sagai Cia 1993 Mao Comue Sciece eseaios a uicaios Aeae omasia a u u "eiaiiy a eomace o mioe isk ogaiaios" e Comue o aea Aeae omasia a u u "Cos Aaysis o -coes oue aiy Aay" IEEE Sym o Mass Soage Sysems - MSS 7 age 9-7 Sa iego CA Seeme 7 Aeae omasia a u u "AI ee Seecio o eeogeeous isk Aays" e Comue eceme 7 sumie Aeae omasia a u u "aa Aocaio i isk Aays wi Muie AI ees" wok i ocess i is wok is eicae o my eoe wie so a amiy ACKNOWLEDGMENT I would like to gratefully and sincerely thank my esteemed advisor Dr. Alexander Thomasian for his understanding, patience, and most importantly, his friendship during my graduate studies at NJIT. Without his expert guidance this dissertation would not have been possible. Not only was he readily available for me, as he so generously is for all of his students, but he always read and responded to the drafts of each chapter of my work more quickly than I could have hoped. His invaluable guidance and encouragement have contributed significantly to the work presented in this dissertation. Many people on the faculty and staff of the NJIT Graduate School and the NJIT computer science department assisted and encouraged me in various ways during my course of studies. I am especially grateful to Dr. David Nassimi, Dr. All Mili, Dr. Cristian Borcea and Dr. Jian Yang for their guidance and abundant help throughout this research. My graduate studies would not have been the same without the social and academic challenges and diversions provided by all my student-colleagues in NJIT. I am particularly thankful to my friends Pan Liu, Wugang Xu, Junilda Spirollari and Yoo Jung An for all the good time we spent together. I thank my parents for their faith in me and allowing me to be as ambitious as I wanted. Without their moral and intellectual guidance through my life, all these would be impossible. Also I would like to thank my parents-in-law and my brother, his family for their continuous support and encouragement. Finally, and most importantly, I would like to thank my wife Hannah for her support, encouragement, help and unwavering love. vi AE O COES Cae age 1 INTRODUCTION 1 1.1 What is RAID? 1 1.2 Demand for Heterogeneous Disk Arrays 4 1.3 Related Studies 5 1.3.1 File Placement 5 1.3.2 HP AutoRAID 6 1.3.3 Previous Studies of HDA 7 1.3.4 Other Approaches 7 1.4 Organization of the Dissertation 8 2 DATA ALLOCATION IN HETEROGENEOUS DISK ARRAYS 9 2.1 Introduction 9 2.2 Allocation Requests 13 2.2.1 Load Increase in Normal Mode 16 2.2.2 Load Increase in Degraded Mode 16 2.3 Balancing Allocations 18 2.4 Experimental Results 21 2.4.1 Effects of ρma and Vmax 35 2.5 Clustered RAID 36 2.6 Conclusions and Related Work 40 3 RAID LEVEL SELECTION FOR HETEROGENEOUS DISK ARRAYS . 42 ii AE O COES (Coiue Cae age 3.1 Introduction 42 3.2 RAID Levels and Their Operation 44 3.3 Modeling Assumptions 48 3.4 Analytical Model 50 3.4.1 Operation in Normal Mode 51 3.4.2 Operation in Degraded Mode 51 3.5 Experimental Results 53 3.5.1 Disk Array Configuration 54 3.5.2 Classification Results 55 3.5.3 The Effect of RAID5 Width on Classification 58 3.5.4 The Effect of Number of Tracks per Stripe Unit 59 3.5.5 The Effect of Mean Seek Time on Classification 59 3.5.6 The Effect of Read/Write Ratio for Full Stripe Accesses . 60 3.6 Effectiveness of Classification on HDA Performance 62 3.7 Conclusions 65 4 RELIABILITY AND PERFORMANCE OF MIRRORED DISK ORGANI- ZATIONS 67 4.1 Introduction 67 4.2 Related Work 69 4.3 RAID1 Organizations 73 4.4 RAID1 Reliability Analysis 76 iii AE O COES (Coiue Cae age 4.5 Comaiso o e ou AI1 Ogaiaios 79 51 eiaiiy Comaiso 79 5 eomaiiy Comaiso 80 4.6 AI1 eomace Aaysis 82 1 Moeig Assumios 82 4.6.2 au-ee o oma Moe o Oeaio 3 3 egae Moe Aaysis 5 7 eomace esus 88 4.8 Cocusios 93 5 AAYSIS O -COES 97 51 Coig o Muie isk aiue oea Aays 97 5 -coe Ogaiaio 99 53 Cos wi Oe aie isk 1 531 ea Cos 1 53 Wie Cos 1 5 Cos wi wo aie isks 13 51 ea Cos 13 5 Wie Cos 19 55 Summay 11 5 iscussio o eomace esus 111 51 Oe aie isk 111 i AE O COES (Coiue Cae age 5 wo aie isks 111 57 oa Imaace wi isk aiues 11 571 oa Imaace o Eac isk wi Oe isk aiue 113 57 oa Imaace o Eac isk wi wo isk aiues 11 5 M Coig Sceme a is oa Icease o eas 119 51 oa Icease o Eac isk wi Oe isk aiue o M 11 5 oa Icease o Eac isk wi wo isk aiues o M 1 59 Comaiso ewee coe a M 15 COCUSIOS 17 AEI A M/G/1 QUEUIG OMUAS 19 AEI EECE UME O OCESSE EQUESS 13 AEI C AAYSIS O EA COS O A UAAIAE AA OCK WI WO AIE ISKS 135 AEI AGOIM O COMUE E OA ICEASE WI WO ISK AIUES I -COE 1 AEI E AGOIM O COMUE E OA ICEASE WI WO ISK AIUES I M 1 EEECES 15 IS O AES ae age 1 Seciicaios o IM 1ES Moe ES-3917W isk ies 1 Comaiso o e Aocaio Meos wi 51=31 a = 1 i oma Moe 3 3 Comaiso o e Aocaio Meos wi 51=31 a = 75 i oma Moe Comaiso o e Aocaio Meos wi 51=31 a = 5 i oma Moe 5 5 Comaiso o e Aocaio Meos wi 51=31 a 1 i egae Moe Comaiso o e Aocaio Meos wi 51=31 a = 75 i egae Moe 7 7 Comaiso o e Aocaio Meos wi 51=31 a = 5 i egae Moe 28 isk Uiiaios Ae Aocaios wi 5 1 = 3 1 = 1 a awi ou Wokoa i egae Moe 3 9 isk Uiiaios Ae Aocaios wi 51=31 = 1 a aace Wokoa i egae Moe 3 1 isk Uiiaios Ae Aocaios wi 51=31 = 1 a Caaciy ou Wokoa i egae Moe 3 11 Sesiiiy o i Mi wi 51=31 a = 1 a i egae Moe 3 1 Sesiiiy o /3 i Mi wi 51=31 a = 1 a i egae Moe 3 13 Eecs o ρx a ma i As Aocaios 35 1 Cage o Caaciy/aiw aio -y 37 i IS O AES (Coiue ae age 15 ume o AI5 Aocaios wi awi ou Wokoa i egae Moe N = 1 3 1 ume o AI5 Aocaios wi awi ou Wokoa i oma Moe N = 1 3 17 ume o AIS Aocaios wi awi ou Wokoa i egae Moe wi yamic aiy Gou Sie W 3 1 ume o AIS Aocaios wi awi ou Wokoa i oma Moe wi yamic aiy Gou Sie W 3 19 Comaiso o eaie ume o Aocaios wi a wiou Cusee AI a 51=1 i egae Moe 39 31 Seciicaios o IM 1ES Moe ES-3917W isk ies 53 3 Cassiicaio o AI ees o a Aocaio eques wi iee aamees i oma Moe