Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ


 Lenard Baker
 1 years ago
 Views:
Transcription
1 Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst Unversty of Texas at Austn Amherst, MA 13 Austn, TX Abstract The performance of strped dsk arrays s governed by two parameters: the strpe unt sze and the degree of strpng. In ths paper, we descrbe technques for determnng the strpe unt sze and degree of strpng for dsk arrays storng varable bt rate contnuous meda data. We present an analytcal model that uses the server confguraton and the workload characterstcs to predct the load on the most heavly loaded dsk n redundant and nonredundant arrays. We then use the model to determne the optmal strpe unt sze for dfferent workloads. We also use the model to study the effect of varous system parameters on the optmal strpe unt sze. To determne the degree of strpng, we frst demonstrate that strpng a contnuous meda stream across all dsks n the array causes the number of clents supported to ncrease sublnearly wth ncrease n the number of dsks. To maxmze the number of clents supported n large arrays, we propose a technque that parttons a dsk array and strpes each meda stream across a sngle partton. Snce load mbalance can occur n such parttoned arrays, we present an analytcal model to compute the mbalance across parttons n the array. We then use the model to determne a partton sze that mnmzes the load mbalance, and hence, maxmzes the number of clents supported by the array. Keywords: Contnuous meda fle servers, strpng technques, dsk arrays 1 Introducton 1.1 Motvaton Advances n computng and communcaton technologes over the past few years have trggered the development of a wde range of nformaton servces (e.g., electronc newspapers, dstance learnng and selfpaced educaton, vdeo mal, etc.). All of these servces nvolve storng, accessng, and processng multple types of nformaton (e.g., text, audo, vdeo, magery, etc.,  whch we collectvely refer to as multmeda). Realzng such servces wll requre the development of fle servers that can effcently handle multple data types. To do so, such fle servers wll be requred to employ effcent placement technques. To help formulate the problem of effcent placement, let us frst ntroduce some termnology. Dgtzaton of audo yelds a sequence of samples and that of vdeo yelds a sequence of frames. A contnuously recorded sequence of audo samples or vdeo frames s referred to as a meda stream. Due to the large storage and bandwdth requrements æ A prelmnary verson of ths paper appeared n the Proceedngs of the Seventh IEEE Internatonal Workshop on Network and Operatng System Support for Dgtal Audo and Vdeo (NOSSDAV 97), pages 25 36, St. Lous, MO, May
2 of such meda streams, multmeda fle servers are generally founded on dsk arrays. To effcently utlze a dsk array, such servers strpe (.e., nterleave) meda streams across dsks n the array. A strpng polcy s governed by two parameters: the strpe unt sze, whch denotes the maxmum amount of logcally contguous data stored on a sngle dsk; and the degree of strpng, whch refers to the number of dsks across whch a partcular meda stream s strped. Recently, technques for determnng the strpe unt sze and the degree of strpng for workloads consstng of textual and numerc data accesses have been proposed [3, 5, 14]. However, these technques are not drectly applcable to fle servers optmzed for storng audo or vdeo (referred to as contnuous meda) due to the followng fundamental characterstcs: æ Realtme requrements of contnuous meda: Textual and numerc data accesses requre good response tmes but no absolute performance guarantees. In contrast, due to ts realtme nature, contnuous meda accesses requre the fle server to provde bounds on response tmes. Hence, a strpe unt sze that mnmzes the average response tme s consdered optmal for textual and numerc data [3], whle a strpe unt sze that mnmzes the tal of the response tme dstrbuton (possbly at the expense of an ncreased average response tme) s more desrable for contnuous meda data. Ths fundamental dfference n the optmzaton crteron has a sgnfcant mpact on the selecton of strpe unt sze. To llustrate, consder Fgure 1(a), whch depcts the hstogram of the response tme observed for two dfferent strpe unt szes (obtaned usng a workload of 6 vdeo clents accessng an array of 16 dsks). It shows that strpe unt szes of 32KB and 64KB yeld average response tmes of 3ms and 32ms, respectvely. The fgure also shows that the hstogram for the 32KB strpe unt sze has a longer tal. If data accesses do not mpose any realtme constrants, 32KB would be chosen as the approprate strpe unt sze. For accesses wth realtme constrants, a strpe unt sze of 64KB would be more desrable. As shown n Fgure 1(b), the block sze that mnmzes the average response tme contnues to dffers from one that mnmzes the 99 th percentle of the response tme (.e., the tal of the hstogram) across a wde range of clent workloads. æ Perodc and sequental nature of contnuous meda: In general, textual and numerc data accesses consst of aperodc reads and wrtes, whle contnuous meda workloads consst of reads and wrtes that are perodc and sequental. Moreover, contnuous meda applcatons have a sgnfcantly larger data rate requrement as compared to textual applcatons. These dfferences n workload characterstcs affect the optmal strpe unt sze. Due to the perodc and sequental nature of contnuous meda, most multmeda fle servers employ a serverpush archtecture to servce contnuous meda requests. Such servers servce clents by perodcally accessng and transmttng data wthout an explct request for each access (n contrast to a clentpull archtecture employed by conventonal fle servers that access data only n response to explct clent requests). The workload seen by dsks n a serverpush archtecture s markedly dfferent from those seen by dsks n a clentpull archtecture. Due to these dfferences, technques developed for conventonal clentpull based servers are napplcable to serverpush based servers. Due to these dfferences, novel technques that optmze the performance of a multmeda fle server for contnuous meda data must be developed. 1.2 Research Contrbutons of Ths Paper In ths paper, we propose technques for determnng the strpe unt sze and the degree of strpng for fle servers storng varable bt rate contnuous meda data. We consder a fle server that servces clents by proceedng n terms of perodc rounds and argue that, n such envronments, a strpe unt sze that mnmzes the servce tme (.e., the total tme spent n retrevng the data requested n a round) of the most heavly loaded dsk s optmal. To determne the optmal strpe unt sze, we develop an analytcal model that uses the server confguraton and a dstrbuton of 2
3 Probablty (a) 16 dsks, 6 clents strpe unt sze = 32kB strpe unt sze = 64kB Optmal strpe unt sze (kb) (b) 16 dsks Average response tme 99th percentle of the response tme Response tme (ms) Number of clents Fgure 1: Effect of dfferent metrcs on the strpe unt sze. the number of blocks accessed by a clent n a round to predct the servce tme of the most heavly loaded dsk n both redundant and nonredundant arrays. By determnng the servce tme of the most heavly loaded dsk across a range of block szes, a strpe unt sze that mnmzes the servce tme can be chosen. We valdate the accuracy of our model through extensve tracedrven smulatons. We demonstrate that, contrary to conventonal wsdom, a large strpe unt sze does not necessarly yeld good server performance. Instead, such a strpe unt sze can adversely affect the qualty of servce guarantees provded to clents, thereby reducng the number of clents supported by the server. We also use the model to: (1) evaluate the effect of varous system parameters (such as the number of clents, number of dsks, etc.) on the strpe unt sze, and (2) derve technques for selectng an optmal strpe unt sze for varous desgn scenaros. We then use the model to determne the optmal degree of strpng for varable bt rate meda streams. We demonstrate that strpng a meda stream across the entre array causes the number of clents supported to ncrease sublnearly wth ncrease n number of dsks. To maxmze the number of clents supported n large arrays, we propose a technque that parttons a dsk array and strpes each meda stream across a sngle partton. Snce load mbalances can occur n such parttoned arrays, we present a model to compute the mbalance across parttons. We then use the model to determne a partton sze that mnmzes the load mbalance, and hence, maxmzes the number of clents supported by the array. The rest of ths paper s organzed as follows. In Secton 2, we address the ssue of determnng an optmal strpe unt sze. Secton 3 descrbes technques for determnng the degree of strpng. Secton 4 descrbes related work, and fnally, Secton 5 summarzes our results. 2 Determnng the Strpe Unt Sze Consder a multmeda server that nterleaves meda streams across dsks by storng successve blocks of a stream on consecutve dsks n a roundrobn manner. The unt of nterleavng, referred to as a meda block or a strpe unt, denotes the maxmum amount of logcally contguous data stored on a sngle dsk. 1 Due to the perodc nature of meda playback, the server servces multple clents by proceedng n perodc rounds. Durng each round, the server retreves a fxed number of meda unts (e.g., vdeo frames or audo samples) for each clent. To ensure contnuous playback, the number of meda unts accessed for a clent must be suffcent to sustan ts playback rate, and the servce tme (.e., the total tme spent n retrevng meda unts durng a round) must not exceed the duraton of a round. If each meda stream s compressed usng a varable bt rate (VBR) compresson algorthm, then the szes of successve meda unts wthn a stream wll vary. Although each clent accesses a fxed number of meda unts n each round, due to varable meda unt szes, the number of blocks requested by the clent can vary from one round 1 We shall use the terms meda block and strpe unt nterchangeably n ths paper. 3
4 to another. The server can servce such clents ether by retrevng a varable number of blocks across rounds, or by retrevng a fxed number of blocks across rounds and employng prefetchng and bufferng schemes to smooth out the varatons. Dependng on the amount of varaton n the stream bt rate, the latter approach can substantally ncrease the ntaton latency (snce suffcent amount of data must be prefetched before the clent can ntate playback). Our experments wth MPEG1 vdeo clents ndcate that, for a round duraton of 1s, accessng data at the average bt rate can cause the ntaton latency to be more than 2s. 2 In contrast, snce no smoothng s performed when a varable number of blocks are accessed, the clents can ntate playback wthout any delay. However, accessng a varable number of blocks can cause load mbalances across dsks n the array and can reduce the number of clents supported by the server. A key challenge s to devse strpng technques that reduce the load mbalance so as to maxmze the number of clents supported. In ths paper, we assume that the server servces clents by accessng a varable number of blocks across rounds, and determne the strpe unt sze and the degree of strpng that acheves ths objectve. In servers that access a varable number of blocks, the set of dsks accessed by dfferent clents durng a round are dfferent, and hence, the total number of blocks accessed can vary from one dsk to another. Snce some dsks are more heavly loaded than others, the servce tme of some of these dsks may occasonally exceed the round duraton, causng playback dscontnutes at clent stes. To mnmze the frequency of such playback dscontnutes, the server must mnmze the servce tme of the most heavly loaded dsk n the array. The servce tme of the most heavly loaded dsk depends on the meda block sze. To observe ths, consder a small meda block sze. Such a block sze ncreases the number of blocks accessed from the array durng a round, thereby dstrbutng the load across dsks and reducng the load mbalance. However, t also ncreases the overhead due to seek and rotatonal latency, thereby ncreasng the servce tme of the most heavly loaded dsk. In contrast, a large block sze reduces the overhead of seek and rotatonal latency, but ncreases the load mbalance, and hence, the servce tme of the most heavly loaded dsk. The server must select a meda block sze that balances these tradeoffs and mnmzes the servce tme of the most heavly loaded dsk n the array. In what follows, we present an analytcal model that uses the characterstcs of the workload and the confguraton of the server to predct the servce tme of the most heavly loaded dsk n nonredundant and redundant dsk arrays. By computng the servce tme of the most heavly loaded dsk across a range of block szes, a meda block sze that mnmzes the servce tme can be chosen. 2.1 Analytcal Models for Determnng the Load on the Array A Model for Nonredundant Arrays Consder a multmeda server that nterleaves meda streams across a dsk array. Gven the confguraton of the server (e.g., number of dsks, ther physcal characterstcs, the round duraton, etc.) and the clent characterstcs (e.g., number of clents, trace of the meda unt szes for each clent, playback rate, etc.), the servce tme of the most heavly loaded dsk n redundant and nonredundant dsk arrays can be computed as follows: 1. Compute the dstrbuton of the number of blocks accessed from a dsk by each clent durng a round usng a trace of meda unt szes. 2. Compute the dstrbuton of the total number of blocks accessed from a dsk by summng the number of blocks requested by each clent from that dsk. 3. Compute the dstrbuton of the number of blocks accessed from the most heavly loaded dsk. 2 The latency s smaller f the clent retreves the fle as a pecewse constant bt rate (CBR) stream [18], rather than a pure CBR stream. However, pecewse CBR retrevals result n a varable load on dsks, snce btrate of clents changes over tme and dfferent clents retreve data at dfferent rates at any nstant. Our models are vald for VBR as well as smoothed pecewse CBR retrevals. 4
5 Frst of the requested blocks Frst of the requested blocks R R R R R R R R R R R R R R R R R Dsks j D 2 D 1 D Dsks j D 2 D 1 D Case 1 : Clent requests 5 blocks Case 2 : Clent requests (D+2) blocks R = requested block Fgure 2: Dfferent scenaros n whch clent accesses a block from dsk j. 4. Gven the dstrbuton of the number of blocks accessed from the most heavly loaded dsk, compute the servce tme dstrbuton for the dsk usng a dsk model. To derve the model for nonredundant arrays, consder a server that nterleaves meda streams across an array of D dsks. Let n clents access the server, each retrevng a meda stream, 3 and let B denote the meda block sze. Snce the server accesses a fxed number of meda unts for each clent durng a round, the dstrbuton of the number of blocks accessed by the clent durng a round can be determned from a trace of the meda unt szes. Let b k, obtaned from ths dstrbuton, denote the probablty that clent accesses k blocks from the array n a round, and let p k j denote the probablty that clent accesses k blocks from dsk j n a round. To compute p1 j, observe that clent wll access exactly one block from dsk j n a round f: (1) t requests m blocks (1 ç m ç D) from the array and the frst of these blocks s stored ether on dsk j or any of the prevous m, 1 dsks; or (2) t requests D + m blocks (1 ç méd) from the array and the frst of these block s stored any dsk other than dsk j or any of the prevous m, 1 dsks. Fgure 2 llustrates these cases. Due to the VBR nature of meda streams, the number of blocks accessed by a clent vares from one round to another. Hence, after a small number of rounds, the frst block s equally lkely to be accessed from any of the dsks n the array. Consequently, p 1 j = D X b m æ m D,1 X D + b D+m æ D, m D Generalzng, clent wll access k blocks (k = 1; 2; 3:::) from dsk j f: (1) t requests èk, 1è æ D + m blocks (1 ç m ç D) from the array and the frst of these blocks s stored on dsk j or any of the prevous m, 1 dsks; or (2) t requests k æ D + m blocks (1 ç méd) from the array and the frst of these blocks s stored on any dsk other than dsk j or any of the prevous m, 1 dsks. Hence, p k j = D X b èk,1èæd+m X æ m D + D,1 b kæd+m æ D, m D Lastly, the probablty that clent does not access dsk j s p j =1, P 1 k=1 p k j. Let X j be a random varable denotng the number of blocks accessed by clent from dsk j durng a round. Then, P èx j = kè =p k j (3) Then, the total number of blocks accessed from dsk j durng a round, N j, can be computed as N j = nx =1 (1) (2) X j (4) 3 Snce contnuous meda requests are domnated by read requests, we confne our focus to read requests. 5
6 Due to the VBR nature of vdeo streams, the number of blocks accessed by clents from the array are ndependent of each other. Thus, X 1j ;X 2j ; :::;X nj are ndependent random varables, and hence, the dstrbuton of N j can be obtaned by applyng the the ztransform 4 to (4). That s, where ZèN j è= ny =1 ZèX j è (5) ZèX j è=p j + zp1 j + z2 p 2 j + z3 p 3 j +æææ (6) Then, the number of blocks accessed from the most heavly loaded dsk 5 s gven by N max = maxèn 1 ;N 2 ;æææ;n D è (7) Due to the round robn nature of meda stream placement, the number of blocks accessed from a dsk s not ndependent of the load on ts neghborng dsks. Snce the precse dependence of these random varables on each other s dffcult to characterze, and snce the maxmum of D dependent random varables s dffcult to compute, as an approxmaton we assume that N j s are ndependent of each other. Later n ths secton, we demonstrate that ths approxmaton does not cause any naccuraces n the predctons of the model. Then, the dstrbuton of N max can be computed as F Nmax èxè =F N1 èxè æ F N2 èxèæææf ND èxè (8) where F Nj s the cumulatve probablty dstrbuton functon of the random varable N j [16]. Havng determned the dstrbuton of the number of blocks accessed from the most heavly loaded dsk, the servce tme of the dsk can then be computed by usng a dsk model. We use one such model that has been proposed n the lterature [14, 22] (see Appendx A for the complete dsk model). The servce tme to access N max blocks of sze B as predcted by the dsk model s: ç max = N max æ èt s + t r è+n max æ B æ t t (9) where t s and t r denote the seek tme and rotatonal latency ncurred whle accessng a block from dsk and t t denotes the transfer tme for a unt amount of data. Thus, gven the server confguraton and the workload characterstcs, the model computes the servce tme dstrbuton of the most heavly loaded dsk for a partcular block sze. Moreover, the model also yelds the dstrbuton of the number of blocks accessed from a dsk wth average load (.e., N j ). The servce tme of such a dsk can then be computed usng the dsk model A Model for Redundant Arrays Snce dsk arrays are hghly susceptble to dsk falures, multmeda servers employ redundances n data storage to guarantee hgh avalablty of data. Most redundant arrays are based on the Redundant Array of Independent Dsks (RAID) archtecture [6, 17]. RAID arrays compute redundant blocks (referred to as party) by takng an exclusveor operaton over data blocks stored on G, 1 dsks, where G é 2, and store t on another dsk. The party block together wth all the data blocks over whch party s computed s referred to as a party group. In the presence of a dsk falure (also referred to as the degraded mode), the server reconstructs a block stored on the faled dsk by 4 The ztransform of a random varable U s the polynomal ZèUè =a + za 1 + z 2 a 2 + æææwhere the coeffcent of the th term n the polynomal represents the probablty that the random varable equals. Thats,PèU = è=a.ifu 1; U 2; :::; U n are n ndependent random varables, and Y = P n ZèUè. The dstrbuton of Y can then be computed usng a polynomal multplcaton of U, thenzèyè=q n =1 =1 the ztransforms of U 1; U 2; æææ; U n [16]. 5 Note that the dsk that s most heavly loaded wll vary from one round to another. Regardless of whch dsk s the most heavly loaded n a partcular round, N max represents ts load. 6
7 accessng the party block and data blocks of the party group stored on survvng dsks. A commonly used RAID archtecture s RAID5 whch uses blocknterleaved party and unformly dstrbutes party blocks across dsks n the array. The multple RAID5 archtecture s an extenson of the RAID5 array n whch the array s parttoned nto clusters of dsks, wth each cluster ndependently computng party nformaton [6]. In the rest of ths secton, we assume a multple RAID5 archtecture for our model. However, the basc approach used n our model s applcable to other RAID archtectures as well. Consder a multmeda server servcng n clents from a RAID5 array consstng of D dsks. Let G denote the party group sze, where G ç D. Then the array contans P = D=G clusters. Let us assume that the server computes party blocks over a sequence of successve blocks from the same meda stream (.e., all data blocks of a party group are consecutve blocks of the same meda stream). Consequently, the server stores successve blocks of a meda stream on dsks storng data blocks of the party group and skps over dsks storng the party blocks. Snce each of the P clusters contans a dsk storng a party block, a request for more than D, P consecutve blocks causes a dsk to be reaccessed. Faultfree Case To compute the servce tme of the most heavly loaded dsk n the faultfree mode, let b k denote the probablty that clent accesses k blocks from the array durng a round, and let p k j denote the probablty that clent accesses k blocks from dsk j durng a round. To compute p 1 j, note that clent wll access dsk j only f dsk j stores a data block (.e., does not store a party block). Moreover, clent wll access a block from dsk j f: (1) t requests m blocks (1 ç m ç D, P ) from the array and the frst of these blocks s stored on dsk j or any of the prevous m,1 dsks storng data blocks; or (2) t requests D, P + m blocks (1 ç méd, P ) from the array and the frst of these blocks s stored on any dsk storng data blocks other than dsk j or any of the prevous m, 1 dsks. Snce party blocks are unformly dstrbuted across dsks, one out of every G blocks stored on a dsk s a party block. Hence, the probablty that dsk j stores a data block s è1, 1=Gè. Due to the VBR nature of meda streams, the frst block s equally lkely to be accessed from any of the D, P dsks storng data blocks. Hence, we get p =è1, 1 1 æ è D,P X j G è X D,P,1 b m m æ D, P + èd,p è+m b æ D, P, m D, P! (1) Generalzng, the probablty that clent accesses k blocks from dsk j s p k =è1, 1 æ è D,P X j G è X D,P,1 èk,1èæèd,p è+m m b æ D, P + kæèd,p è+m b æ D, P,! m D, P èk =1; 2; 3;:::è (11) Snce P = D G,, è1 1 G get D,P X p k j = D,P è can be rewrtten as D. Substtutng ths value n the above equaton and smplfyng, we èk,1èæèd,p è+m b X æ m D + D,P,1 kæèd,p è+m b æ D, P, m D èk =1; 2; 3;:::è (12) Let X j be the random varable representng the number of blocks accessed by clent from dsk j durng a round. Then P èx j = kè = p k j. Usng ths dstrbuton of X j, the dstrbutons of the number of blocks accessed and the servce tme of the most heavly loaded dsk n the faultfree state can be derved usng the method presented n Secton Falure Case To compute the servce tme of the most heavly loaded dsk n degraded mode, assume that dsk f n the array experences a falure, where 1 ç f ç D. Snce each cluster ndependently computes party, dsks that do not belong 7
8 Frst block s between dsks j and f R R R R R Dsks f j D 2 D 1 D Case 1 : Clent accesses dsk j but not dsk f Dsks R = requested block A = addtonal block A R R R R A A A A A f j D 2 D 1 D Case 2: Clent accesses dsk f but not dsk j (an addtonal block s accessed from dsk j) A A R R R R R A A A Dsks f j D 2 D 1 D Case 3 : Clent accesses both dsks j and f Fgure 3: Dfferent scenaros n whch clent accesses a block from dsk j n degraded mode. to the cluster contanng dsk f are unaffected by ths falure, and hence, for these dsks, the number of blocks accessed n a round s the same as that n the faultfree state. All dsks belongng to the cluster contanng dsk f, however, wll experence an ncrease n load whenever a clent accesses a block from dsk f. To compute the number of blocks accessed by clent from dsk j belongng to the cluster contanng dsk f,let æ denote the number of dsks storng data blocks contaned between dsks j andf (ncludng dsk j), and let æ denote the number of dsks storng data blocks not contaned between dsks j and f. Observe that, f no party block s stored on a dsk between dsks j and f,thenæ =j j, f j. Otherwseæ =j j, f j,1. In ether case, æ=d, P, æ. To compute p 1 j, note that clent wll access exactly one block from dsk j f t requests m blocks from the array and one of the followng three condtons hold: (1) a block s requested from dsk j but not from dsk f, or(2)a block s requested from dsk f but not from dsk j (and hence, a block must be accessed from dsk j to reconstruct the block on dsk f), or (3) a block s requested from both dsks j and f and both blocks belong to the same party group (and hence, no addtonal block needs to be accessed from dsk j). Fgure 3 llustrates these cases for an array wth G = D. To compute the probablty that clent accesses dsk j but not dsk f, let us frst consder the case when f éj. Clent wll access dsk j only f dsk j stores a data block of the party group. Moreover, clent wll access a block from dsk j but not dsk f f: (1) t requests m blocks (1 ç m ç æ) from the array and the frst of these blocks s stored on dsk j or any of the prevous m,1 dsks; or (2) t requests æ + m blocks (1 ç m ç æ,æ) from the array and the frst of these blocks s stored on dsk j or any of the prevous æ, 1 dsks; or (3) t requests æ+m blocks (1 ç m ç æ, 1) from the array and the frst of these blocks s stored on dsk j or any of the prevous æ, m, 1 dsks. A smlar argument holds for the case when f éj, except that we must consder the last block accessed by the clent nstead of the frst block. Snce the frst (last) block s equally lkely to be stored on any of the D, P dsks storng data blocks, and snce the probablty that dsk j stores a data block s è1, 1 G è,weget Substtutng D,P D p =è1, 1 G è æ è æx X æ,æ b m m æ D, P + b æ+m æ æ D, P + for, è1 1 è n the above equaton and smplfyng, we get G p = æx b m æ m æ,æ X D + b æ+m æ æ D + æx b æ+m æx b æ+m æ æ, m D æ æ, m D, P è (13) By symmetry, the probablty that clent accesses dsk f but not dsk j s the same as the probablty that t accesses dsk j but not dsk f. To compute the probablty that clent accesses a block from both dsks j and f, observe that the clent must request at least æ blocks from the array (see Fgure 3). Moreover, to be able to access dsk j and f both dsks j and f must store data blocks. Hence, the clent accesses blocks belongng to the same party group from dsks j and f f (1) t requests èm + æè blocks from the array, ( ç m ç æ) and the frst of these blocks s stored on a dsk not 8 (14)
9 contaned between dsks j and f; or (2) t accesses èd, P + mè blocks and the frst of these blocks s stored on a dsk such that only one block s accessed from dsks j and f. Snce two out of every G party groups wll store a party block on dsks j or f, the probablty that nether dsk j nor dsk f stores a party block s è1, 2 è. Hence, G the probablty of accessng blocks belongng to the same party group from dsks f and j s p =è1, 2 G è æ è æ X m= b m+æ æ m +1 D, P + æx D,P +m b æ, æ m +1 D, P! (15) Hence, summng the probablty of the three cases, we get p 1 j èæ; æè = 2 æ p + p,thats, p 1 j èæ; æè = 2 æ è æx b m è1, 2 G è æ è æ X m= æ m æ,æ X D + b æ+m æ æ D + æx b m+æ æ m +1 D, P + æx b æ+m æ æ, m D! + D,P +m b æ, æ m +1 D, P! (16) The value of p 1 j computed n the above equaton s a functon of parameters æ and æ. Dependng on whether or not a party block s stored on a dsk between dsks j and f, we have two cases. If a party block s stored on a dsk between dsks j and f, thenwegetæ 1 =j j, f j,1 and æ 1 = D, P, æ 1. Snce party blocks are unformly dstrbuted across dsks n the array, and the probablty that of ths case s s æ 1 G. If no party block s stored between dsks j and f,thenwegetæ 2 =j j, f j and æ 2 = D, P, æ 2, and the probablty of ths case s è1, æ 1 G è. Hence, the overall probablty that clent accesses one block from dsk j s p 1 j = æ 1 G æ p1 j èæ 1; æ 1 è+è1, æ 1 G è æ p1 j èæ 2; æ 2 è (17) Generalzng, the probablty that clent accesses k blocks from dsk j s where p k j èæ; æè = 2 æ è æx p k j = æ 1 G æ pk j èæ 1; æ 1 è+è1, æ 1 G è æ pk j èæ 2; æ 2 è (18) b m+æ è1, 2 G è æ è æ X m= æ m æ,æ X D + b æ+m+æ æ æ D + æx b m+æ+æ æ m +1 D, P + æx b æ+m+æ æ æ,! m + D D,P +m+æ b æ, æ m +1 D, P! (19) and æ =èk, 1è æ èd, P è. LetX j be the random varable representng the number of blocks accessed by clent from dsk j durng a round. Then P èx j = kè =p k j. Then, usng ths dstrbuton of X j, the dstrbuton of the number of blocks accessed and the servce tme of the most heavly loaded dsk n the degraded mode can be derved n a manner smlar to that n Secton Valdaton of the Models To valdate our models, we have bult an eventbased, tracedrven dsk array smulator called DskSm. 6 We dgtzed a number of traces and used these traces to run smulatons over a wde range of system parameters (e.g., dfferent number of clents, dfferent number of dsks, dfferent round duratons, etc.). The characterstcs of the traces are 6 The source code for DskSm s publcly avalable from 9
10 Servce tme (msec) (a) RAID, 16 dsks, 6 clents, 3 frames/s Average loaded dsk (smulator) Average loaded dsk (model) Servce tme (msec) (b) RAID, 16 dsks, 6 clents, 3 frames/s Most heavly loaded dsk (model) Most heavly loaded dsk (smulator) Block sze (kb) Block sze (kb) Fgure 4: Varaton n the servce tme of the average loaded dsk and the most heavly loaded dsk. Servce Tme (msec) RAID, 16 dsks, 6 clents, 3 frames/s 7th percentle (model) 7th percentle (smulator) 8th percentle (model) 8th percentle (smulator) 95th percentle (model) 95th percentle (smulator) Block sze (kb) Fgure 5: Valdaton of the model for varous percentles of the servce tme. lsted n Table 1. For each combnaton of parameters, we conducted multple smulaton runs and computed the 95% confdence ntervals of the expected number of blocks accessed and the expected servce tme of the most heavly loaded dsk. To valdate the model for nonredundant arrays, we computed the expected number of blocks accessed and the expected servce tme of the most heavly loaded dsk for each workload. The values predcted by the model were found to be wthn the 95% confdence ntervals obtaned from smulatons. Fgures 4(a) and (b) plot these values for one such workload. Smlar results were obtaned for varous percentles of the servce tme of the most heavly loaded dsk (see Fgure 5). The model for redundant arrays was valdated smlarly [19]. Thus, the smulaton results valdate the predctons made by our analytcal models over a large parameter space. The servce tme graphs of the average loaded dsk and the most heavly loaded dsk n Fgure 4 lead us to the followng observatons: æ As shown n Fgure 4(a), the servce tme of the average loaded dsk decreases monotoncally wth ncreasng block sze. Ths s because ncreasng the block sze decreases the number of blocks accessed from the dsk, thereby reducng dsk seek and rotatonal latency overheads. æ The servce tme of the most heavly loaded dsk, on the other hand, decreases ntally and then starts ncreasng wth ncrease n block sze (see Fgure 4(b)). To explan ths behavor, let us frst ntroduce some termnology. Let cn max and bç max, respectvely, denote the expected number of blocks accessed from the most heavly loaded dsk and the expected servce tme of the most heavly loaded dsk durng a round, and let bç avg denote the expected servce tme of the average loaded dsk. Then, the mbalance n the servce tmes of the most heavly loaded dsk and the average loaded dsk I s (referred to as the load mbalance) s defned as I s = bç max, bç avg bç max 1
11 Table 1: Characterstcs of Vdeo Traces MPEG Encodng Length Frame Bt rate Fle Pattern (frames) rate Mb/s Fraser IèBBPè 3 BB Newscast IèBBPè 3 BB Flntstones IèBBPè 3 BB = 1, bç avg bç max (2) From (9), the porton of the servce tme spent n dsk seek and rotatonal latency s cn max æ èt s + t r è = bç max, cn max æ B æ t t. Hence, the overhead due to seek and rotatonal latency O can be defned as: O = bç max, cn max æ B æ t t bç max = 1, c N max æ B æ t t bç max (21) Assumng a fxed server confguraton and workload characterstcs, ncreasng the block sze decreases the number of blocks accessed from the array. The smaller the number of blocks beng accessed, the smaller s the probablty of achevng equtable dstrbuton of load across dsks (snce the array becomes sparsely loaded). Hence, ncreasng block sze yelds an ncrease n the load mbalance I s. On the other hand, ncreasng the block sze causes the seek and rotatonal latency overhead to decrease. Fgure 6 shows these varatons n I s and O. For each meda block sze, the servce tme of the most heavly loaded dsk s governed by the relatve values of I s and O. As shown n Fgure 6, at small block szes, the latency overhead domnates, and hence the servce tme decreases wth ncrease n block sze. At large block szes, the load mbalance domnates the latency overhead, and causes the servce tme to ncrease wth ncrease n block sze. Consequently, the servce tme of the most heavly loaded dsk decreases ntally and then starts ncreasng wth ncrease n block sze. From the above analyss, we conclude that mnmzng the servce tme of the average loaded dsk requres the server to choose a block sze that s as large as possble. In contrast, mnmzng the servce tme of the most heavly loaded dsk requres the server to choose a block sze that mnmzes the combned effects of I s and O. To maxmze the number of clents supported for besteffort workloads, the server must mnmze the servce tme of the average loaded dsk, whle for contnuous meda workloads, mnmzng the servce tme of the most heavly loaded dsk s more desrable. Hence, the optmal block sze obtaned for the two envronments can dffer sgnfcantly. The precse value of the optmal block sze for a contnuous meda workload depends on the qualty of servce requrements of clents and the values of varous system parameters (such as the number of clents, ther playback rate, the number of dsks, etc.). In what follows, we examne the effect of these factors on the optmal block sze. For each parameter, we also compute the range of block szes that yelds a servce tme wthn x% of the mnmum. The upper and lower bounds of ths set of block szes defne the x% optmal envelope for the workload [3, 22]. By choosng a block sze that s contaned wthn the x% optmal envelope of all values of the parameter, the server can ensure performance that s wthn x% of the optmal regardless of the workload. 11
12 Normalzed metrc RAID, 16 dsks, 6 clents Load mbalance Latency overhead Block sze (kb) Fgure 6: Varaton n the load mbalance and the latency overhead. 2.3 Factors Affectng the Optmal Block Sze Effect of Qualty of Servce Observe that, the model yelds a dstrbuton of the servce tme of the most heavly loaded dsk n the array. To determne the optmal block sze, the server must frst choose a partcular percentle of the servce tme as the metrc and then compute the block sze that mnmzes that percentle. The choce of a partcular percentle depends on the QoS requrements of clents (where QoS s defned to be the fracton of request deadlnes that can be volated). For nstance, the server can choose the expected value of the servce tme (whch, n our experments, approxmately corresponds to the 7 th percentle of the servce tme dstrbuton) to determne the block sze. In such a scenaro, there s a 3% chance that the actual value of the servce tme durng a round wll exceed ts expected value, resultng n a large number of request deadlne volatons. If clents have strngent qualty of servce (QoS) requrements (.e., they can tolerate only rare volatons of request deadlnes), then the server must choose hgher percentles of the servce tme to provde the desred performance guarantees. For example, by choosng the 95 th percentle of servce tme dstrbuton of the most heavly loaded dsk, the server can ensure that the servce tme does not exceed ts estmated value n more than 5% of the rounds. Snce dfferent percentles of the servce tme yeld dfferent optmal block szes (see Fgure 7(a)), the server must carefully choose an approprate percentle of the servce tme as the metrc based on the QoS requrements of clents. Fgure 7(b) shows the varaton n optmal block sze and the 5% optmal envelope for dfferent percentles of the servce tme. Larger percentles of the servce tme correspond to more strngent QoS requrements. To provde strngent QoS, the server must mnmze the varaton n servce tmes of the most heavly loaded dsk across rounds. Ths can be acheved by selectng a block sze whch reduces the load mbalance. Snce the load mbalance decreases wth decrease n the block sze (Fgure 6), a small block sze yelds better performance for more strngent QoS requrements. Hence, the optmal block sze and the 5% optmal envelope decrease wth ncrease n percentle of the servce tme. Observe from Fgure 7(a) that, the servce tme of the most heavly loaded dsk ncreases slowly for block szes larger than the optmal block sze. Ths mght lead us to beleve that choosng a block sze that s larger than the optmal wll yeld near optmal performance, whle reducng dsk latency overheads. However, Fgure 7(b) demonstrates that choosng the largest possble block sze contaned n the optmal envelope for a partcular QoS degrades performance for more strngent QoS. For nstance, choosng the upper 5% optmal envelope of the 7 th percentle (.e., 256KB) as the block sze wll cause a loss n performance for the 95 th percentle (snce 256KB s not contaned n the 5% optmal envelope of the 95 th percentle). Ths argument also shows that adhoc technques that select a large block sze (e.g., selectng the track sze as the block sze) can sgnfcantly affect the server performance, and hence, the number of clents supported. To acheve good performance over a range of QoS requrements, a block sze that s contaned wthn the x% optmal envelope of a wde range of percentles must be chosen. 12
13 Servce Tme (ms) (a) RAID, 16 dsks, 6 clents 7th percentle 8th percentle 95th percentle Optmal block sze (kb) (b) RAID, 16 dsks, 6 clents Upper 5% envelope Lower 5% envelope Optmal block sze Optmal block sze (kb) Percentle of servce tme Fgure 7: Effect of Qualty of Servce Normalzed metrc (a) RAID, 16 dsks Load mbalance, 2 clents Latency overhead, 2 clents Load mbalance, 1 clents Latency overhead, 1 clents Optmal block sze (kb) (b) RAID, 16 dsks Upper 5% optmal envelope Lower 5% optmal envelope Optmal block sze Block sze (kb) Number of clents Fgure 8: Effect of number of clents on the optmal block sze Effect of system parameters The model can also be used to study the effect of varous system parameters on the optmal block sze. Snce the servce tme of the most heavly loaded dsk s mnmzed when the combned effects of I s and O are mnmzed, the effect of varyng a system parameter on the optmal block sze can be analyzed by studyng ts effect on I s and O. We can ntutvely understand the effect of a parameter on the optmal block sze by assumng that the pont of ntersecton of I s and O governs the mnma of the servce tme curve. Then, f a change n the value of the system parameter ncreases the number of blocks accessed from the array, t ncreases the probablty of achevng equtable load dstrbuton across dsks, and hence, reduces I s. Such a reducton causes the I s curve to shft downward. Ths shfts the pont of ntersecton of I s and O (and hence, the mnma of the servce tme curve) to the rght, thereby ncreasng the optmal block sze. On the other hand, f a change n the value of the parameter causes a decrease n the number of blocks per dsk, then the load mbalance ncreases. Such an ncrease causes the pont of ntersecton of the I s and O curves to shft to the left, thereby reducng the optmal block sze. To llustrate, consder the effect of varaton n the number of clents on the optmal block sze. For a fxed server confguraton, ncrease n the number of clents ncreases the number of blocks accessed from the dsk array, and thereby ncreases the probablty of achevng equtable dstrbuton of load across dsks. Ths reduces the load mbalance I s, causng the I s curve to shft downwards. In contrast, the latency overhead curve, whch s governed mostly by the physcal characterstcs of dsks, shfts only margnally. Ths shfts the pont of ntersecton of I s and O curves to the rght (see Fgure 8(a)). Hence, the optmal meda block sze ncreases wth ncrease n the number of clents accessng the server (see Fgure 8(b)). The 5% optmal envelope also ncreases wth ncrease n number of clents for smlar reasons. We have determned the effect of varous system parameters, such as the number of dsks, ther physcal characterstcs, the playback rate of clents, the round duraton, etc., on the optmal block sze. The effect of all of these 13
14 Table 2: Effect of varous parameters on the block sze Parameter Number of clents Playback rate Qualty of Servce (QoS) Number of dsks Round duraton Dsk zones Party Group Sze Effect of ncrease n parameter on optmal block sze Block sze ncreases Block sze ncreases Block sze decreases Block sze decreases Block sze ncreases Block sze ncreases from nner zones to outer zones Block sze ncreases 3 25 (a) RAID, 6 clents Upper 5% envelope Lower 5% envelope Optmal block sze Optmal block sze (kb) Number of dsks Fgure 9: Effect of the number of dsks on the optmal block sze. parameters on the optmal block sze can be explaned usng arguments smlar to those presented above. In what follows, we dscuss our results n detal (Table 2 summarzes these results). Number of Dsks For a fxed number of clents, ncreasng the number of dsks n the system decreases the number of blocks accessed per dsk. Ths decreases the probablty of achevng equtable dstrbuton of load across dsks, and hence, ncreases the load mbalance I s. An ncrease n I s causes the I s curve to shft upwards and the pont of ntersecton of I s and O to shft to the left. Thus, the optmal block sze decreases wth an ncrease n the number of dsks (see Fgure 9). Playback Rate and Round Duraton Assumng a fxed round duraton (playback rate), ncreasng the playback rate (round duraton) causes a clent to request a proportonately larger amount of data per round to sustan contnuous playback. Ths causes a larger number of blocks to be accessed from the array, thereby spreadng the load across dsks and reducng the load mbalance. Consequently, the optmal block sze and the 5% optmal envelope ncrease wth ncrease n playback rate (round duraton). (see Fgures 1(a) and 1(b)). Dsk Characterstcs To evaluate the effect of varyng dsk characterstcs on the optmal block sze, we frst defne the work coeffcent of adsk[3]: 14
15 35 3 (a) RAID, 16 dsks, 6 clents 35 3 (b) RAID, 16 dsks, 6 clents Upper 5% envelope Lower 5% envelope Optmal block sze Optmal block sze (kb) Upper 5% envelope Lower 5% envelope Optmal Block Sze Optmal block sze (kb) Playback rate (frames/s) Round duraton (s) Fgure 1: Effect of the playback rate of clents and the round duraton on the optmal block sze. Table 3: Characterstcs of varous Seagate Dsks Model Abbrev Capacty Average Avg Rotatonal Transfer Transfer Work aton MB seek (ms) latency (ms) rate (MB/s) tme (ms/kb) Coeffcent Medalst M x 1,3 Hawk H x 1,3 Barracuda1 B x 1,3 Barracuda2 B x 1,3 Elte9 E x 1,3 Defnton 1 The work coeffcent of a dsk s defned as W = tme to transfer unt amount of data average seek + average rotatonal latency The work coeffcent measures the relatve varaton n the latency overheads and transfer tmes of dsks. Table 3 shows the characterstcs of varous Seagate dsks and ther work coeffcents. Recall from (9) that bç max = cn max æ èt s + t r è+cn max æ B æ t t Hence, from the defnton of O,weget: O =1, c N max æ B æ t t bç max = èt s + t r è èt s + t r è+b æ t t = 1 1+B æ t t èt s+t rè = 1 1+B æ W Hence, for a partcular block sze, ncreasng W decreases O. Ths causes the pont of ntersecton of the I s and O curves to shft to the left. Ths ndcates that the optmal block sze vares nversely wth the work coeffcent. Fgure 11(a) and Table 3 demonstrate ths behavor for dfferent Seagate dsks. Zoned Dsks Our experments thus far assumed a sngle transfer rate for the entre dsk. However, modern dsks are parttoned nto zones, wth outer zones havng hgher recordng denstes and larger data transfer rates as compared to nner zones. Due to larger transfer rates (and hence, smaller transfer tmes), outer zones have a smaller work coeffcent. Consequently, the optmal block sze and the 5% optmal envelope for a zone ncreases as we proceed from nner zones to outer zones (see Fgure 11(b)). 15 (22)
16 25 2 (a) RAID, 16 dsks, 6 clents Upper 5% envelope Lower 5% envelope Optmal block sze 3 25 (b) RAID, 16 dsks, 6 clents Upper 5% envelope Lower 5% envelope Optmal block curve Optmal block sze (kb) Optmal block sze (kb) E9 M H B1 B2 Dsk Model Track transfer rate (MB/s) Fgure 11: Varaton n the optmal block sze wth dsk characterstcs. Fgure (a) compares the optmal block sze for dfferent Seagate dsks. Dsks used n the experment are Elte9, Medalst, Hawk, Barracuda1, and Barracuda2. Fgure (b) shows the varaton n the optmal block sze for dfferent transfer rates. Lower transfer rates represent nner zones. Servce tme (msec) (a) 32 dsks, 5 clents, normal mode 4 38 RAID5 party group=4 RAID5 party group=8 36 RAID5 party group=16 34 RAID5 party group=32 RAID Block sze (kb) Optmal block sze (kb) (b) RAID5, 32 dsks, 5 clents, degraded mode Upper 5% envelope Lower 5% envelope Optmal block sze Party group sze Fgure 12: Effect of party group sze. Snce the optmal block sze vares across zones, a multmeda server can: () choose an optmal block sze for each zone, or () choose a sngle block sze for all zones. Recently several placement polces that employ dfferent block szes for dfferent zones have been proposed [2, 21]. Our models enable us to parameterze these polces by choosng an approprate block sze for each zone. Snce use of a sngle block sze for all zones can cause an ncrease n the servce tme of the most heavly loaded dsk, a multmeda server must choose a block sze that mnmzes ths ncrease across all zones. To do so, the server must select a block sze that s contaned wthn the x% optmal envelope of all zones. Ths ensures that the servce tme of the most heavly loaded dsk s always wthn x% of the mnmum. To llustrate, Fgure 11(b) shows that a block sze of 96KB s contaned wthn the 5% optmal envelope of all zones on the dsk. Observe that these polces form two ends of a spectrum. Whereas one yelds optmal performance, the other smplfes storage space management. The server can balance these tradeoffs by choosng an ntermedate polcy that groups consecutve zones and selects a sngle block sze for each group. Party Group Sze Snce nonredundant arrays do not mantan any party nformaton, the party group sze s a parameter that s relevant only to redundant dsk arrays. Fgure 12(a) depcts the servce tme of the most heavly loaded dsk n a RAID5 array n the normal operatng mode. It demonstrates that, n the absence of a dsk falure, the servce tme of the most heavly loaded dsk n a RAID5 array s almost dentcal to that obtaned for an equvalent RAID array. Moreover, the servce tme of the most heavly loaded dsk s ndependent of the party group sze. Consequently, 16
17 the optmal block sze obtaned for a RAID5 array n the normal operatng mode s ndependent of the party group sze and s dentcal to that obtaned for a RAID array. Next consder the RAID5 array wth a sngle dsk falure. Let G denote the party group sze. In such a scenaro, whenever a clent accesses a block stored on the faled dsk, the server must access the remanng blocks of the party groups stored on the survvng G, 1 dsks to reconstruct the requested block. Hence, wth ncrease n party group sze, the number of addtonal blocks that must be accessed to reconstruct a block on the faled dsk ncreases, ncreasng the load on survvng dsks. Ths results n an effectve ncrease n the playback rate of clents. As explaned n earler n ths secton, ncreasng the playback rate of clents causes an ncrease n the optmal meda block sze and the 5% optmal envelope. Hence, the optmal block sze and the optmal envelope n the degraded mode ncrease wth ncrease n the party group sze (see Fgure 12(b)). 2.4 Selectng an Optmal Block Sze Havng examned the effect of the server confguraton and the workload characterstcs on the block sze, we now present procedures for selectng an optmal block sze. The procedure for selectng an optmal block sze depends on the desgn goals for the multmeda server, whch n turn are dctated by the operatng envronment. To llustrate, for multmeda servers offerng commercal servces (e.g., vdeoondemand, onlne news, etc.), the prmary goal s to maxmze revenue by maxmzng the number of clents that can be supported by the server. In contrast, for multmeda servers whch servce clents wth heterogeneous QoS, the number of clents that can be supported depends on the exact workload mx (.e., the proporton of clents wth dfferent requrements). Snce the workload mx can vary over tme, the goal for such servers s to provde the best possble performance over a wde range of workloads. Dfferng desgn goals may requre the system desgner to choose completely dfferent meda block szes. To determne a block sze that maxmzes the number of clents supported, let us assume that all parameters determnng the server confguraton (.e., the number of dsks, ther physcal characterstcs, the round duraton, etc.) are known at desgn tme. Also, assume that the data rate of clents and ther QoS requrements are known. Then, a block sze that maxmzes the number of clents supported can be computed by the followng two step procedure: (1) For a gven number of clents, n, determne the servce tme of the most heavly loaded dsk for dfferent block szes and select the block sze that mnmzes the servce tme; (2) If the servce tme of the most heavly loaded dsk for ths block sze s less than the round duraton, then ncrement n and repeat step (1). The block sze that s obtaned when the servce tme of the most heavly loaded dsk equals the round duraton maxmzes the number of clents supported by the server. In general computng envronments, due to the heterogeneous nature of the workload, some of the workload characterstcs may be unknown at desgn tme (e.g., the number of clents accessng the server). In such a scenaro, a block sze that yelds good performance over a wde range of workloads must be chosen [3]. For every parameter that s unknown at desgn tme, the range over whch the parameter s lkely to vary must frst be estmated. The optmal block sze and the x% optmal envelope for each combnaton of these parameters s then computed usng the model. Let S 1 ;S 2 ;æææ denote sets, each contanng the x% optmal envelope for a partcular combnaton of these parameters. Then, the set of block szes that yelds servce tmes wthn x% of the mnmum over all possble combnatons of these parameters s S = S 1 ës 2 ë :::.IfS s empty, then the entre procedure must be repeated for a larger values of x untl a nonempty set of block szes s obtaned. Fgure 13 llustrates the process of computng a feasble soluton (.e., a nonempty set S) over a range of clent workloads. 3 Determnng the Degree of Strpng In addton to determnng the strpe unt sze, defnng a strpng polcy requres the determnaton of degree of strpng. A multmeda server can ether strpe a meda stream across all dsks n the array or across a subset of the dsks. Whereas the former polcy s referred to as wde strpng, the latter polcy s referred to as narrow strpng. 17
18 Infeasble Soluton Feasble Soluton Upper 7% envelope Block Sze (kb) Upper 5% envelope Lower 5% envelope Optmal block sze curve Block Sze (kb) Lower 7% envelope Optmal block sze curve Optmal block sze set S Number of Clents Number of Clents Fgure 13: Selectng a block sze that yelds nearoptmal performance, regardless of the number of clents accessng the server. The shaded regon denotes the set of block szes S that yeld servce tmes wthn 7% of the mnmum for all workloads. To evaluate the relatve merts of these polces, consder a multmeda server that employs wde strpng to nterleave meda streams across dsks n the array. Let us assume that the performance of the server s measured n terms of the maxmum number of clents that t can support. In an deal scenaro, ncrease n the number of dsks n the system should result n a lnear ncrease n the number of clents that can be supported by the server. That s, the number of clents supported by a dsk array consstng of D dsks should be D tmes the number of clents that can be supported by a sngle dsk. However, as shown n Fgure 14(a), the number of clents supported by the server ncreases sublnearly wth ncrease n the number of dsks. Ths can be attrbuted to the followng two reasons: æ Realtme requrements of clents: Due to the realtme requrements of clents, the number of clents supported by the server s constraned by the most heavly loaded dsk. Specfcally, the number of clents accessng the server reaches ts maxmum value when the servce tme of the most heavly loaded dsk equals the round duraton. At ths pont, however, the servce tme of a dsk wth average load s smaller than the round duraton. The resultng load mbalance causes most of the dsks n the array to be underutlzed. æ Reducton n optmal block sze: As explaned n Secton 2.3.2, an ncrease n the number of dsks n the system causes the load mbalance I s to ncrease. An ncrease n the number of dsks also ncreases the number of clents that can be supported by the server. Larger the number of clents accessng the server, the smaller the load mbalance I s. Thus, the combned effect of ncreasng the number of dsks and the number of clents accessng the server governs the actual value of I s. Fgure 14(b) plots the varaton n mbalance I s aganst the (number of dsks n the system, maxmum number of clents supported) pars. It llustrates that the ncrease n I s due to an ncrease n the number of dsks domnates the decrease n I s due to an ncrease n the number of clents, causng the actual mbalance to ncrease. Hence, a small block sze must be chosen to compensate for the ncreased mbalance, causng a decrease n the optmal block sze (see Fgure 14(c)). Snce a small block sze mposes a larger latency overhead, the overall throughput of the array decreases, causng a reducton n the number of clents that can be supported. To mnmze the mpact of these factors, a server can: (1) partton the dsk array nto mutually exclusve groups of dsks, and (2) strpe each meda stream only wthn a partton. Snce each partton acts as an ndependent dsk array and the number of dsks per partton s small, such an approach: (1) reduces the load mbalance wthn each partton, and (2) ncreases the optmal block sze for a partton (and thereby reduces the latency overhead). In such parttoned arrays, load mbalances can occur f clents are not equtably dstrbuted among all the parttons. Hence, the partton sze must be chosen so as to smultaneously mnmze the mpact of load mbalance across parttons and the load mbalance wthn a partton. In what follows, we frst present a model for determnng the load mbalance across parttons, and then descrbe a procedure for determnng the a partton sze that maxmzes the number of clents supported. 18
19 Number of clents supported (a) Wde Strpng Wde strpng (actual) Wde Strpng (deal) Load mbalance (b) Imbalance wthn a partton Load mbalance Optmal block sze (kb) (c) Varaton n optmal blocks sze Optmal block sze Number of dsks.325 (16,214)(24,39)(32,395) (48,58) (64,77) (Number of dsks, Maxmum number of clents) (16,214)(24,39)(32,395) (48,58) (64,77) (Number of dsks, Maxmum number of clents) Fgure 14: Loss n the number of clents supported n large dsk arrays and factors contrbutng to ths loss. 3.1 Modelng the Imbalance Across Parttons To compute the load mbalance across parttons, consder a dsk array consstng of D dsks that s parttoned nto groups of d dsks each. Let us assume that the server employs a placement polcy that assgns streams to parttons such that each partton s equally lkely to be accessed by a new request [8, 23]. That s, the probablty that a newly arrvng clent accesses a partton s q = d=d. Insuchascenaro, fn clents access the server, then the probablty that m clents access the j th partton s bnomally dstrbuted, and s gven as: è! P èy n j = mè = m æ q m æ è1, qè n,m (23) where Y j s a random varable representng the number of clents accessng the j th partton. Then the number of clents accessng the most heavly loaded partton s Y max = maxèy 1 ;Y 2 ;:::;Y D è (24) d Snce the load on a partton s ndependent of other parttons, Y 1 ;Y 2 ;:::;Y D d Hence, the dstrbuton of Y max can be computed as: are ndependent random varables. F Ymax èxè =F Y1 èxè æ F Y2 èxèæææf Y Dd èxè (25) where F Yj s the cumulatve probablty dstrbuton functon of the random varable Y j [16]. Gven the dstrbuton of Y and Y max, we can compute the expected number of requests on the average and the most heavly loaded parttons (denoted by by and by max, respectvely). Usng these values, we can defne the the load mbalance across parttons (denoted by I p )as: è I p = 1, Y b! Y b (26) max Thus, gven the number of dsks n the array and the partton sze, we can compute the load mbalance across parttons. 3.2 Determnng the Partton Sze For a fxed number of dsks, ncreasng the partton sze ncreases the load mbalance I s wthn a partton (Fgure 14(b)), whle decreasng the load mbalance I p across parttons (Fgure 15). Moreover, as shown n Fgure 14(c), ncreasng the partton sze results n a reducton n the optmal block sze (thereby ncreasng the seek and rotatonal latency overhead). Consequently, the server must determne the degree of strpng (.e., partton sze) that balances these tradeoffs. 19
20 Gven the models for predctng: (1) the load mbalance across parttons (Secton 3.1), (2) the load mbalance wthn a partton (Secton 2.1.1), a procedure for choosng a partton sze that maxmzes the number of clents supported by the server s as follows: Procedure ComputeParttonSze 1. Choose an ntal partton sze of d=1. 2. Usng the model presented n Secton 2.1.1, compute the maxmum number of clents, n, that can be supported by a sngle partton of sze d (.e., the number of clents at whch the servce tme of the most heavly loaded dsk equals the round duraton). 3. Assumng that n clents access the array, usng the model presented n Secton 3.1, compute the expected number of clents, by max, accessng the most heavly loaded partton. 4. If by max én, then ncrement n and repeat step (3). When by max = n,thenn denotes the maxmum number of clents that can be supported by the array wth a partton sze of d. 5. Increment the partton sze d, and repeat steps (2) thorough (4) untl no further mprovements n the number of clents s obtaned (.e., untl n starts decreasng wth ncrease n d). Ths yelds a partton sze that maxmzes the number of clents that can be supported. In the above procedure, note that the lmt on the number of clents that can be supported by the entre array s reached when the most heavly loaded partton reaches ts maxmum capacty. However, at ths pont, the number of clents accessng other parttons s less than ther maxmum capacty. Hence, the total number of clents that can be supported by the array does not ncrease lnearly wth number of parttons (.e., nén æ D d ). Fgure 16(a) llustrates the result of executng ths teratve procedure for an array of 12 dsks. Snce the number of clents that can be supported by the array s maxmzed at d =1, the array should be parttoned nto 12 parttons of 1 dsks each for optmal performance. Fgure 16(b) demonstrates the varaton n the optmal partton sze wth ncrease n the number of dsks n the array. Fnally, Fgure 16(c) llustrates the mprovement n the number of clents supported due to parttonng. For small dsk arrays, snce wde strpng s close to the deal case, the addtonal gans due to parttonng are small. For large dsk arrays, however, parttonng yelds a approxmately a 1% ncrease n the number of clents supported as compared to the wde strpng. Fgure 16(c) also demonstrates that parttonng coupled wth statc load balancng algorthms does not completely brdge the gap between the number of clents supported by the array n the deal case (.e., when the number of clents ncreases lnearly wth array sze) and that obtaned usng wde strpng. To further reduce the loss n the number of clents supported, the server must replcate streams across parttons and employ dynamc load balancng schemes. The mprovement n performance yelded by such a scheme s at the expense of hgher storage space requrement and more complex storage space management algorthms. Detaled costperformance tradeoffs of such an approach s beyond the scope of ths paper. 4 Related Work Several research projects have developed smulaton and analytcal technques for optmzng the performance of strped dsk arrays for conventonal workloads [3, 4, 5, 14]. As demonstrated n Secton 1, due to the realtme nature of contnuous meda accesses, these technques are not drectly applcable for optmzng performance n multmeda servers. The problem of determnng the optmal strpe unt sze for nonredundant arrays storng contnuous meda was studed n [22]. A model that predcts the servce tme of the most heavly loaded dsk for nonredundant arrays (henceforth referred to as the VRG model) was also proposed n the paper. The VRG model uses worst case assumptons about the number of blocks accessed by a clent durng a round to compute the servce tme of the most heavly loaded dsk. In contrast, our model uses actual dstrbutons of the number of blocks accessed by a clent 2
benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More information9.1 The Cumulative Sum Control Chart
Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s
More informationI. SCOPE, APPLICABILITY AND PARAMETERS Scope
D Executve Board Annex 9 Page A/R ethodologcal Tool alculaton of the number of sample plots for measurements wthn A/R D project actvtes (Verson 0) I. SOPE, PIABIITY AD PARAETERS Scope. Ths tool s applcable
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationMoment of a force about a point and about an axis
3. STATICS O RIGID BODIES In the precedng chapter t was assumed that each of the bodes consdered could be treated as a sngle partcle. Such a vew, however, s not always possble, and a body, n general, should
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationData Broadcast on a MultiSystem Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819840 (2008) Data Broadcast on a MultSystem Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationVoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays
VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty
More informationAn MILP model for planning of batch plants operating in a campaignmode
An MILP model for plannng of batch plants operatng n a campagnmode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafeconcet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationPolitecnico di Torino. Porto Institutional Repository
Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A costeffectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A costeffectve
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationNasdaq Iceland Bond Indices 01 April 2015
Nasdaq Iceland Bond Indces 01 Aprl 2015 Fxed duraton Indces Introducton Nasdaq Iceland (the Exchange) began calculatng ts current bond ndces n the begnnng of 2005. They were a response to recent changes
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 MultpleChoce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multplechoce questons. For each queston, only one of the answers s correct.
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationSolution of Algebraic and Transcendental Equations
CHAPTER Soluton of Algerac and Transcendental Equatons. INTRODUCTION One of the most common prolem encountered n engneerng analyss s that gven a functon f (, fnd the values of for whch f ( = 0. The soluton
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdodong,
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationJ. Parallel Distrib. Comput. Environmentconscious scheduling of HPC applications on distributed Cloudoriented data centers
J. Parallel Dstrb. Comput. 71 (2011) 732 749 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Envronmentconscous schedulng of HPC applcatons
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (5357) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng BüyükbakkalköyIstanbul
More informationA ReplicationBased and Fault Tolerant Allocation Algorithm for Cloud Computing
A ReplcatonBased and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 RyadhSaud Araba Abstract The very large nfrastructure
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationMethodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications
Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and
More informationMETHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS
METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes causeandeffect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy Scurve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy Scurve Regresson ChengWu Chen, Morrs H. L. Wang and TngYa Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationII. PROBABILITY OF AN EVENT
II. PROBABILITY OF AN EVENT As ndcated above, probablty s a quantfcaton, or a mathematcal model, of a random experment. Ths quantfcaton s a measure of the lkelhood that a gven event wll occur when the
More informationTHE TITANIC SHIPWRECK: WHO WAS
THE TITANIC SHIPWRECK: WHO WAS MOST LIKELY TO SURVIVE? A STATISTICAL ANALYSIS Ths paper examnes the probablty of survvng the Ttanc shpwreck usng lmted dependent varable regresson analyss. Ths appled analyss
More informationMultivariate EWMA Control Chart
Multvarate EWMA Control Chart Summary The Multvarate EWMA Control Chart procedure creates control charts for two or more numerc varables. Examnng the varables n a multvarate sense s extremely mportant
More information2. SYSTEM MODEL. the SLA (unlike the only other related mechanism [15] we can compare it is never able to meet the SLA).
Managng Server Energy and Operatonal Costs n Hostng Centers Yyu Chen Dept. of IE Penn State Unversty Unversty Park, PA 16802 yzc107@psu.edu Anand Svasubramanam Dept. of CSE Penn State Unversty Unversty
More informationRetailers must constantly strive for excellence in operations; extremely narrow profit margins
Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/
More informationQuality Adjustment of Secondhand Motor Vehicle Application of Hedonic Approach in Hong Kong s Consumer Price Index
Qualty Adustment of Secondhand Motor Vehcle Applcaton of Hedonc Approach n Hong Kong s Consumer Prce Index Prepared for the 14 th Meetng of the Ottawa Group on Prce Indces 20 22 May 2015, Tokyo, Japan
More informationOptimization Model of Reliable Data Storage in Cloud Environment Using Genetic Algorithm
Internatonal Journal of Grd Dstrbuton Computng, pp.175190 http://dx.do.org/10.14257/gdc.2014.7.6.14 Optmzaton odel of Relable Data Storage n Cloud Envronment Usng Genetc Algorthm Feng Lu 1,2,3, Hatao
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CACbased Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CACbased Dynamc Prcng Bader AlManthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More informationCloudbased Social Application Deployment using Local Processing and Global Distribution
Cloudbased Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer
More information1 Example 1: Axisaligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationU.C. Berkeley CS270: Algorithms Lecture 4 Professor Vazirani and Professor Rao Jan 27,2011 Lecturer: Umesh Vazirani Last revised February 10, 2012
U.C. Berkeley CS270: Algorthms Lecture 4 Professor Vazran and Professor Rao Jan 27,2011 Lecturer: Umesh Vazran Last revsed February 10, 2012 Lecture 4 1 The multplcatve weghts update method The multplcatve
More informationMAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11
Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de
More informationSelfAdaptive SLADriven Capacity Management for Internet Services
SelfAdaptve SLADrven Capacty Management for Internet Servces Bruno Abrahao, Vrglo Almeda and Jussara Almeda Computer Scence Department Federal Unversty of Mnas Geras, Brazl Alex Zhang, Drk Beyer and
More informationAn Introduction to 3G MonteCarlo simulations within ProMan
An Introducton to 3G MonteCarlo smulatons wthn ProMan responsble edtor: Hermann Buddendck AWE Communcatons GmbH OttoLlenthalStr. 36 D71034 Böblngen Phone: +49 70 31 71 49 716 Fax: +49 70 31 71 49
More informationDynamic Resource Allocation and Power Management in Virtualized Data Centers
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabsusa.com, mjneely@usc.edu
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE YuL Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationFORMAL ANALYSIS FOR REALTIME SCHEDULING
FORMAL ANALYSIS FOR REALTIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationNonlinear data mapping by neural networks
Nonlnear data mappng by neural networks R.P.W. Dun Delft Unversty of Technology, Netherlands Abstract A revew s gven of the use of neural networks for nonlnear mappng of hgh dmensonal data on lower dmensonal
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More informationMany etailers providing attended home delivery, especially egrocers, offer narrow delivery time slots to
Vol. 45, No. 3, August 2011, pp. 435 449 ssn 00411655 essn 15265447 11 4503 0435 do 10.1287/trsc.1100.0346 2011 INFORMS Tme Slot Management n Attended Home Delvery Nels Agatz Department of Decson and
More information) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More information2008/8. An integrated model for warehouse and inventory planning. Géraldine Strack and Yves Pochet
2008/8 An ntegrated model for warehouse and nventory plannng Géraldne Strack and Yves Pochet CORE Voe du Roman Pays 34 B1348 LouvanlaNeuve, Belgum. Tel (32 10) 47 43 04 Fax (32 10) 47 43 01 Emal: corestatlbrary@uclouvan.be
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? ChuShu L Department of Internatonal Busness, Asa Unversty, Tawan ShengChang
More informationControl Charts for Means (Simulation)
Chapter 290 Control Charts for Means (Smulaton) Introducton Ths procedure allows you to study the run length dstrbuton of Shewhart (Xbar), Cusum, FIR Cusum, and EWMA process control charts for means usng
More informationRESEARCH ON DUALSHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9 July, 007 RESEARCH ON DUALSHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationA GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS
A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS Shanthy Menezes 1 and S. Venkatesan 2 1 Department of Computer Scence, Unversty of Texas at Dallas, Rchardson, TX, USA 1 shanthy.menezes@student.utdallas.edu
More informationNetwork Aware LoadBalancing via Parallel VM Migration for Data Centers
Network Aware LoadBalancng va Parallel VM Mgraton for Data Centers KunTng Chen 2, Chen Chen 12, PoHsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationAnalysis of EnergyConserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC97), March 223, 1997. 1 Analyss of EnergyConservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationEvaluating credit risk models: A critique and a new proposal
Evaluatng credt rsk models: A crtque and a new proposal Hergen Frerchs* Gunter Löffler Unversty of Frankfurt (Man) February 14, 2001 Abstract Evaluatng the qualty of credt portfolo rsk models s an mportant
More informationCost Minimization using Renewable Cooling and Thermal Energy Storage in CDNs
Cost Mnmzaton usng Renewable Coolng and Thermal Energy Storage n CDNs Stephen Lee College of Informaton and Computer Scences UMass, Amherst stephenlee@cs.umass.edu Rahul Urgaonkar IBM Research rurgaon@us.bm.com
More informationPreventive Maintenance and Replacement Scheduling: Models and Algorithms
Preventve Mantenance and Replacement Schedulng: Models and Algorthms By Kamran S. Moghaddam B.S. Unversty of Tehran 200 M.S. Tehran Polytechnc 2003 A Dssertaton Proposal Submtted to the Faculty of the
More informationRiskbased Fatigue Estimate of Deep Water Risers  Course Project for EM388F: Fracture Mechanics, Spring 2008
Rskbased Fatgue Estmate of Deep Water Rsers  Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationFORCED CONVECTION HEAT TRANSFER IN A DOUBLE PIPE HEAT EXCHANGER
FORCED CONVECION HEA RANSFER IN A DOUBLE PIPE HEA EXCHANGER Dr. J. Mchael Doster Department of Nuclear Engneerng Box 7909 North Carolna State Unversty Ralegh, NC 276957909 Introducton he convectve heat
More informationSchedulability Bound of Weighted Round Robin Schedulers for Hard RealTime Systems
Schedulablty Bound of Weghted Round Robn Schedulers for Hard RealTme Systems Janja Wu, JyhCharn Lu, and We Zhao Department of Computer Scence, Texas A&M Unversty {janjaw, lu, zhao}@cs.tamu.edu Abstract
More informationGraph Theory and Cayley s Formula
Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll
More informationAllocating Time and Resources in Project Management Under Uncertainty
Proceedngs of the 36th Hawa Internatonal Conference on System Scences  23 Allocatng Tme and Resources n Project Management Under Uncertanty Mark A. Turnqust School of Cvl and Envronmental Eng. Cornell
More informationA Dynamic Load Balancing for Massive Multiplayer Online Game Server
A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedocho
More informationGenerator WarmUp Characteristics
NO. REV. NO. : ; ~ Generator WarmUp Characterstcs PAGE OF Ths document descrbes the warmup process of the SNAP27 Generator Assembly after the sotope capsule s nserted. Several nqures have recently been
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 /  Communcaton Networks II (Görg) SS20  www.comnets.unbremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationChapter 7. RandomVariate Generation 7.1. Prof. Dr. Mesut Güneş Ch. 7 RandomVariate Generation
Chapter 7 RandomVarate Generaton 7. Contents Inversetransform Technque AcceptanceRejecton Technque Specal Propertes 7. Purpose & Overvew Develop understandng of generatng samples from a specfed dstrbuton
More informationMultiSource Video Multicast in PeertoPeer Networks
ultsource Vdeo ultcast n PeertoPeer Networks Francsco de Asís LópezFuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationFrequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources  Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationtaposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com
G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng
More informationLearning the Best Kth Channel for QoS Provisioning in Cognitive Networks
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More information