Scalable QoS-Aware Disk-Scheduling
|
|
- Arnold Morton
- 6 years ago
- Views:
Transcription
1 Scalable QoS-Aware Dsk-Schedulng Wald G. Aref Khaled El-Bassyoun Ibrahm Kamel Mohamed F. Mokbel Department of Computer Scences, urdue Unversty, West Lafayette, IN anasonc Informaton and Networkng echnologes Laboratory. wo Research Way rnceton, NJ Abstract A ualty of servce (QoS) aware dsk schedulng algorthm s presented. It s applcable n envronments where data reuests arrve wth dfferent QoS reurements such as real-tme deadlne, and user prorty. revous work on dsk schedulng has focused on optmzng the seek tmes and/or meetng the real-tme deadlnes. A unfed framework for QoS dsk schedulng s presented that scales wth the number of schedulng parameters. he general dea s based on modelng the dsk scheduler reuests as ponts n the mult-dmensonal space, where each of the dmensons represents one of the parameters (e.g., one dmenson represents the reuest deadlne, another represents the dsk cylnder number, and a thrd dmenson represents the prorty of the reuest, etc.). hen the dsk schedulng problem reduces to the problem of fndng a lnear order to traverse these mult-dmensonal ponts. Space-fllng curves are adopted to defne a lnear order for sortng and schedulng objects that le n the mult-dmensonal space. hs generalzes the one-dmensonal dsk schedulng algorthms (e.g., EDF, SAF, FIFO). Several technues are presented to show how a QoS-aware dsk scheduler deals wth the progressve arrval of reuests over tme. Smulaton experments are presented to show a comparson of the alternatve technues and to demonstrate the scalablty of the proposed QoSaware dsk schedulng algorthm over other tradtonal approaches. 1. Introducton Buldng relable and effcent dsk schedulers has always been a very challengng task. It has become even more so wth today s complex systems and demandng applcatons. As applcatons grow n complexty, more reurements are mposed on dsk schedulers, for example, the problem of hs reasearch s supported by the Natonal Scence Foundaton NSF under Grant No. IIS dsk schedulng n multmeda servers. In addton to maxmzng the bandwdth of the dsk, the dsk scheduler has to take nto consderaton the real-tme deadlne constrants of the page reuests, e.g., as n the case of vdeo streamng. If clents are prortzed based on ualty of servce guarantees, then the dsk scheduler mght as well consder the prorty of the reuests n ts dsk ueue. Wrtng a dsk scheduler that handles real-tme and ualty of servce constrants n addton to maxmzng the dsk bandwdth s a challengng and a hard task [2]. Smlar ssues arse when desgnng schedulers for mult-threaded CUs, network-attached storage devces (NASDs) [9, 16], etc. In the attempt to satsfy these concurrent and conflctng reurements, scheduler desgners and algorthm developers depend manly on heurstcs to code such schedulers. It s not always clear that these schedulers are far to all aspects of the system, or controllable n a measurable way to favor one aspect of the system over the other. he target of ths paper s to revolutonze the way dsk schedulers are developed. he general dea s based on modelng the dsk reuests as ponts n the mult-dmensonal space where each dmenson represents one of the parameters (e.g., one dmenson represents the reuest deadlne, another represents the dsk cylnder number and the thrd dmenson represents the prorty of the reuest, etc.). hen the scheduler problem reduces to fndng a lnear order to traverse these multdmensonal ponts. he underlyng theory s based on space-fllng curves (SFCs). A space-fllng curve maps the mult-dmensonal space nto the one-dmensonal space. It acts lke a thread that passes through every cell element (or pxel) n the mult-dmensonal space so that every cell s vsted exactly once. hus, space-fllng curves are adopted to defne a lnear order for sortng and schedulng objects that le n the mult-dmensonal space. For example, n a QoSaware dsk scheduler, when a reuest arrves to the dsk ueue, the reuest s parameters (e.g., ts dsk cylnder number, ts real-tme deadlne, etc.) are passed as arguments to the space-fllng curve functon, whch returns a onedmensonal value that represents the locaton of the re-
2 (a) Sweep (b) C-Scan (c) eano (d) Gray (e) Hlbert (f) Spral (g) Dagonal Fgure 1. wo-dmensonal Space-Fllng Curves. uest n the dsk ueue. As a result, the dsk ueue s always sorted n the specfed space-fllng curve order. Usng space-fllng curves as the bases for mult-parameter dsk schedulng has numerous advantages, ncludng scalablty (n terms of the number of schedulng parameters), ease of code development, ease of code mantenance, the ablty to analyze the ualty of the schedules generated, and the ablty to automate the scheduler development process n a fashon smlar to automatc generaton of programmng language complers. he rest of ths paper s organzed as follows. Secton 2 dscusses the related work of dsk schedulng and the use of space-fllng curves n dfferent applcatons. In Secton 3, we develop space-fllng curve based dsk schedulng algorthms. Secton 4 adopts the noton of rregularty as a measure of the ualty of the scheduled order provded by a space-fllng curve. Secton 5 presents a comprehensve study of the developed algorthms on dfferent space-fllng curves. Fnally, Secton 6 concludes the paper. 2. Related Work he problem of schedulng a set of tasks wth tme and resource constrants s known to be N-complete [19]. Several heurstcs have been developed to approxmately optmze the schedulng problem. radtonal dsk schedulng algorthms [5, 8, 12, 28] are optmzed for aggregate throughput. hese algorthms, ncludng SCAN, LOOK, C- SCAN, and SAF (Shortest Access me Frst), am to mnmze seek tme and/or rotatonal latency overheads. hey offer no QoS assurance other than perhaps absence of starvaton. Deadlne-based schedulng algorthms [1, 4, 15, 25] have bult on the basc earlest deadlne frst (EDF) schedule of reuests to ensure that deadlnes are met. hese algorthms, ncludng SCAN-EDF and feasble-deadlne EDF, perform restrcted reorderngs wthn the basc EDF schedule to reduce dsk head movements whle preservng the deadlne constrants. Lke prevous work on QoS-aware dsk schedulng, space-fllng curves explctly recognze the exstence of multple and sometmes antagonstc servce objectves n the schedulng problem. Unlke prevous work that focuses on specfc problem nstances, we use a more general model of mappng servce reuests n the mult-dmensonal space nto a lnear order that balances between the dfferent dmensons. Dsk schedulers based on space-fllng curves generalze tradtonal dsk schedulers. For example, SAF can be modeled by the Sweep SFC (Fgure 1a) by assgnng the access tme to the vertcal dmenson. Smlarly, EDF s modeled by the Sweep SFC by assgnng the deadlne to the vertcal dmenson. Space-Fllng curves are frst dscovered by eano [24] where he ntroduced a mappng from the unt nterval to the unt suare (Fgure 1c). Hlbert [11] generalzes the dea for a mappng of the whole space (Fgure 1e). Followng the eano and Hlbert curves, many space-fllng curves have been proposed, e.g., see [3, 6]. In ths paper, we focus on the space-fllng curves shown n Fgure 1, namely the Sweep, C-Scan, eano, Hlbert, Gray, Spral, and Dagonal SFCs. However, the developed theory and schedulng algorthms apply to other space-fllng curves. Space-fllng curves are used n many applcatons n computer scence and engneerng felds, e.g., spatal jon [22], range ueres [13], spatal access method [7], R-ree [14], mult-dmensonal ndexng [18], and mage processng [29]. Up to the authors knowledge usng space-fllng curves as a schedulng tool s a novel applcaton. 3. Dsk-Schedulng Algorthms based on Space-Fllng Curves In the QoS-aware dsk scheduler, a dsk reuest s modeled by multple parameters, (e.g., the dsk cylnder, the real-tme deadlne, the prorty, etc.) and represented as a pont n the mult-dmensonal space where each parameter corresponds to one dmenson. Usng a space-fllng curve, the mult-dmensonal dsk reuest s converted to a onedmensonal value. hen, dsk reuests are nserted nto a prorty ueue accordng to ther one-dmensonal value wth a lower value ndcatng a hgher prorty. Fgure 2 gves an llustraton of an SFC-based dsk scheduler. o help n understandng the proposed algorthms, we present
3 SFC Scheduler 1 2 Dsk reuest wth D parameters 1, 2,..., D D < cur Fully reemptve Non reemptve > cur Fully reemptve Non reemptve One dmensonal value Dsk Server cur cur cur cur SFC Based prorty ueue Fgure 2. SFC-based Dsk Scheduler the noton of a full cycle n a space-fllng curve. Defnton 3.1: A full cycle n a space-fllng curve wth N prorty levels n each dmenson of a D-dmensonal space s a contguous move from the frst pont, say pont 0, to the last pont, say pont, passng through all the ponts n the space exactly once. A dsk reuest takes a poston n the cycle accordng to ts space-fllng curve value. Dsk reuests are stored n the prorty ueue accordng to ther cycle poston. he dsk server walks through a cycle by servng all dsk reuests n accordng to ther cycle poston. Fgure 3 presents two straghtforward approaches of usng spacefllng curves n dsk-schedulng. he Non-reemptve SFC Dsk Scheduler: In ths approach, once the dsk server starts to walk through a full cycle of a space-fllng curve, the cycle s never preempted. A ly arrved reuest s nserted n the dsk ueue f and only f t wll not preempt the current cycle (Fgure 3c). If needs to preempt the cycle (.e., has hgher prorty than ), then t s nserted n a watng ueue (Fgure 3b). he cycle s fnshed when the dsk reuest wth the lowest prorty n s served, then, all reuests from are moved to and a cycle s generated. he Fully-reemptve SFC Dsk Scheduler: hs s the smplest approach. All reuests are nserted nto a sngle dsk ueue accordng to ther space-fllng curve prorty. hs scheduler s fully-preemptve n the sense that any ncomng reuest wth hgher prorty than preempts the current cycle and starts a one (Fgure 3a). However, when has lower prorty than, t s nserted n wthout affectng the current cycle (Fgure 3c). he fully-preemptve SFC dsk scheduler serves all dsk reuests accordng to ther prorty. Low prorty reuests may starve due to the contnuous arrval of hgh prorty reuests. On the other hand, the non-preemptve SFC dsk scheduler does not lead to starvaton snce t guarantees that lower prorty dsk reuests n a certan cycle wll be served before startng a cycle. However, a prorty nverson takes place where hgher prorty dsk reuests may wat for lower prorty dsk reuests to be served. he drawbacks of the two approaches rase the motvaton for havng a combned dsk scheduler that has the merts of both schedulers. In the followng secton, we present a novel dsk schedul- preempts the cycle by nsertng nto. cannot preempt the cycle. So, s nserted nto the watng ueue. has lower prorty than cur So, nsertng nto does not affect the cycle. (a) (b) (c) Fgure 3. he Non-reemptve and Fully- reemptve SFC dsk schedulers. ng algorthm that avods the drawbacks of these algorthms,.e., respects the dsk reuest prorty and avods starvaton he Condtonally-reemptve SFC Dsk Scheduler Algorthm As a trade-off between the fully-preemptve and the nonpreemptve dsk schedulers, n the condtonally-preemptve dsk schedulng algorthm, a ly arrved dsk reuest preempts the process of walkng through a full cycle f and only f t has sgnfcantly hgher prorty than the currently served dsk reuest. o uantfy the meanng of sgnfcantly hgher prorty, we defne a blockng wndow wth sze (the rounded box wth thck border n Fgure 4) that sldes wth n. hen, s consdered as a prorty sgnfcantly hgher than f and only f. he wndow sze s a compromse between the fully-preemptve and the nonpreemptve dsk schedulers. Settng =0 corresponds to the fully-preemptve dsk scheduler, whle settng to a very large value corresponds to the non-preemptve dsk scheduler. When arrves whle the scheduler s gong to serve, then one of the followng three cases takes place: 1. (Fgure 4a). hs means that has lower prorty than. Hence, s nserted nto as nsertng t nto wll not preempt the cycle. 2.!! (Fgure 4b). hs means that les nsde the blockng wndow. Although has a prorty hgher than that of, but t s not hgh enough to preempt the space-fllng curve cycle. So, s nserted n the watng ueue. 3. "# $% (Fgure 4c). hs means that has a prorty that s sgnfcantly hgher than that of
4 > cur w < cur < cur w w cur cur w < cur w cur Dsk Server Hgher prorty Blockng Wndow Current poston of 1 Lower prorty has lower prorty than cur So, nsertng nto does not affect the cycle. has hgher prorty than cur, but has sgnfcantly hgh prorty not hgh enough to preempt the cycle. w.r.t.. So, SFC cycles cur So, s nserted nto. preempted to serve. (a) (b) (c) Fgure 4. he Condtonally-reemptve SFC Dsk Scheduler.. So, t s worth to preempt the space-fllng curve cycle by nsertng n. here are two ssues that need to be addressed; frst, how to deal wth the occurrence of prorty nverson that result from dsk reuests that le nsde the blockng wndow (stored n ) and have hgher prorty than some reuests n. Second, wth any value of less than (the last pont n a cycle), there s stll a chance of starvaton, where a contnuous stream of very hgh prorty reuests may arrve. he next two sectons propose alternatve approaches for dealng wth these two problems Mnmzng rorty Inverson he dsk reuests that le n wndow are stored n. hs results n prorty nverson as the blocked reuests have hgher prorty than. In ths secton, we propose three alternatves to deal wth ths stuaton. Fgure 5 gves an example that demonstrates the dfference among the three proposed schedulng polces. Assume that whle s beng served, all the other dsk reuests,,,,, and have arrved. Notce that,, and are nserted n snce they le nsde the wndow. and are nserted n snce they have lower prorty than. s nserted n snce t has a sgnfcantly hgher prorty than. Serve and Resume (SR): he space-fllng curve cycle s preempted only by nsertng the ly arrvng reuest of sgnfcant hgh prorty nto. After preemptng the cycle and servng, the process of servng the cycle s resumed. As n Fgure 5, after servng, followng the cycle order would result n servng. However, the cycle s preempted to serve ( has a sgnfcantly hgher prorty than ). After servng, the cycle s resumed to serve the dsk reuests n ( and ). Fnally, the next cycle (watng) ueue s consdered and s served. Hence, the fnal order s,,,,,, Current Cycle ueue Next Cycle ueue Fgure 5. Example of Condtonally- reemptve SFC Dsk Scheduler. Serve, Resume and romote (SR): SR acts exactly as SR. In addton, before the dsk starts to serve a reuest from, t checks for any reuest that becomes wth a sgnfcantly hgher prorty. If such a reuest s found, SR promotes ths reuest and nserts t n. So, the space-fllng curve cycle can be preempted ether by a ly arrved reuest or by an old reuest that eventually becomes of sgnfcant hgher prorty. In Fgure 5, after servng, the cycle s preempted to serve. hen, before servng, SR detects that now les outsde the wndow of. Hence, s served before. Contnung n ths way, the fnal order wll be,,,,,,. Serve and Scan (SS): When the cycle s preempted due to the arrval of a dsk reuest, all the reuests n are scanned and served n ther prorty order. In Fgure 5, when the cycle s preempted to serve, all the dsk reuests nsde the wndow (next cycle ueue ) are served before returnng to the current cycle ueue. Hence, the fnal order wll be,,,,,, Starvaton Avodance If the wndow sze remans fxed, an adversary would stll select dsk reuests n a manner that results n a starvaton of other dsk reuests. o avod starvaton, we propose to expand the wndow sze durng the course of executng the schedulng algorthm. As ncreases, t eventually becomes large enough to prevent preempton and hence avods starvaton. In ths secton, we propose two polces for expandng the wndow sze. Always Expand (AE): In AE, the wndow sze s ncreased by a constant factor, expanson factor, wth any preempton of the space-fllng curve cycle. Eventually, wll be large enough to prevent any cycle preempton and hence, the dsk scheduler works as the non-preemptve dsk schedulng algorthm whch avods starvaton. Expand and Reset (ER): ER s the same as AE where we ncrease the wndow sze by a constant factor. However, when a dsk reuest s served and another dsk reuest from
5 # s dspatched, ER resets to ts orgnal value. he objectve s to acheve a balance between the non-preemptve and the fully-preemptve schedulers. Whle n AE, once a scheduler becomes a non-preemptve one (due to the ncrease of ), t contnues to work as the non-preemptve scheduler, n ER, the scheduler moves back and forth between workng as the non-preemptve scheduler and as the condtonally-preemptve scheduler wth dfferent values of. 4. he Qualty of Space-Fllng Curves An optmal space-fllng curve s one that sorts ponts n space n ascendng order for all dmensons. In realty, when a space-fllng curve attempts to sort the ponts n ascendng order accordng to one dmenson, t fals to do the same for the other dmensons. A good space-fllng curve for one dmenson s not necessarly good for the other dmensons. In ths secton, we ntroduce the concept of rregularty as a measure of goodness of space-fllng curves [20]. hen, we show how the rregularty can be used as an ndcator for the practcal performance measures, e.g., dsk utlzaton, prorty nverson, and deadlne losses Irregularty n Space-Fllng Curves In order to measure the schedulng ualty of a spacefllng curve, we ntroduce the concept of rregularty as a measure of goodness for the schedulng order mposed by a space-fllng curve. Irregularty s measured for each dmenson separately. It gves an ndcator of how a space-fllng curve s far from the optmal. he lower the rregularty, the better the space-fllng curve s. Defnton 4.1: For any two ponts, and, n the D-dmensonal space wth coordnates, respectvely, and for a gven space-fllng curve, f s vsted before, we say that an rregularty occurs between and n dmenson ff. Fgure 6 demonstrates all possble scenaros that can lead to an rregularty n the two-dmensonal space, where the arrows n the curves ndcate the order mposed by the underlyng space-fllng curve,.e., pont s vsted before pont. Formally, for a gven space-fllng curve n the -dmensonal space wth grd sze, the number of rregulartes for any dmenson s:! $ " # $ %'& # # '( An optmal schedule for any dmenson would have no rregularty. In contrast, the worst-case schedule for any dmenson s to sort all the reuests n reverse order wth respect to..u j y.u y.u j y.u y.u y.u j y.u y.u j y.u.u.u j j.u.u.u.u x x x x x j x j.u x x (a) No Irregularty n x, y (b) Irregularty n x only (c) Irregularty n y only (d) Irregularty n x, y Fgure 6. Irregularty n 2D space Irregularty as a Measure of erformance In ths secton, we show that the rregularty can be used as a practcal measure of performance. hree experments have been conducted to show the effect of lower rregularty on dsk utlzaton, prorty nverson, and deadlne losses. In the experments, we assume eght prorty levels wth one dsk reuest for each level. hs results n 8! possble dfferent schedules. he optmal schedule would have no rregularty whle the worst-case schedule would have 28 rregulartes [20] Dsk Utlzaton In ths secton, we nvestgate the correlaton between rregularty as a measure of goodness and dsk utlzaton. We conduct the followng experment. Assume that we have a dsk wth eght consecutve dsk cylnder zones, say ) to )+*. We map these consecutve cylnder zones to eght levels of prorty n the rregularty frame of work. Assume that each cylnder zone contans one dsk reuest. he objectve s to serve all dsk reuests whle mnmzng seek tme overhead (.e., ncreasng the dsk utlzaton). he dsk head s ntally located at the frst cylnder ). he seek tme between any two consecutve cylnders s,. Irregularty s computed based on the shortest possble seek tme from the current locaton. For example, the best schedule s ) ) ) ) ) ) ) ) * whch results n a seek tme of -, and has zero rregularty. he worst-case schedule s )+*.) ).) /) /).) /) where each tme the sched- uler chooses the furthest cylnder to serve, ths results n 28 rregulartes and a seek tme of 021,. Fgure 7a gves the relaton between rregularty and dsk utlzaton, where for each possble number of rregulartes (vares from 0, the optmal, to 28, the worst), we compute the average seek tme over all schedules that result n rregularty. From Fgure 7a, we notce that the average seek tme and the rregularty n a seuence of dsk reuest schedule are almost lnearly correlated,.e., the lower the rregularty the better the dsk utlzaton s and vse versa. herefore, we can deduce that rregularty can be used as a measure of goodness for dsk performance. he advantage of usng rregularty as a measure of goodness s that we can compute t analytcally, and hence be able to analytcally uantze the
6 Average seek tme Irregularty Number of rorty Inversons Irregularty Average Deadlne Loss Irregularty (a) Seek tme (b) rorty (c) Deadlne Fgure 7. Irregularty as a practcal measures. schedulng ualty for a gven schedulng polcy rorty Inverson rorty nverson takes place when a hgher prorty dsk reuest s watng for a lower prorty dsk reuest to be served. In ths experment, we assume that all dsk reuests le n the same cylnder, so there s no seek tme overhead. here are eght levels of prortes to *, and one dsk reuest per prorty level. When a dsk reuest wth prorty s served, we compute the prorty nverson as the number of dsk reuests wth prorty ( that are watng for to be served. Fgure 7b gves the effect of rregularty on prorty nverson. As can be seen from the fgure, rregularty and prorty nverson are lnearly correlated. he lower the rregularty, the lower the occurrence of prorty nverson s and vse versa. Hence, rregularty may be used as a good performance measure that reflects the ualty of a schedule generated by a gven scheduler w.r.t. prorty nverson Deadlne Loss In ths experment, we assume that we have eght prorty to * per prorty level. Assume that each dsk reuest needs constant servce tme, say msec. Assume further that hgher prorty reuests have more tght deadlnes, so, the deadlne levels from % for each reuest s, and there s one dsk reuest where (. Notce that means relaxed deadlnes, and hence no deadlne volaton would take place. We conduct ths experment n the followng way: For each possble number of rregulartes (vares from 0, the optmal, to 28, the worst), we compute the average deadlne losses over all schedules that result n rregularty. Fgure 7c gves the relatonshp between rregularty and the number of deadlne losses where we set =20 msec and =25 msec. he same fgure s obtaned for any values for where (. From the fgure, notce that the lower the rregularty, the lower the deadlne losses, and vse versa. Also, the fgure demonstrates a lnear correlaton between rregularty and the number of deadlne losses. Hence, rregularty can be used as a measure of goodness for deadlne loss performance as well. herefore, lowerng the rregularty s favorable n the case of real tme applcatons. 5. erformance Evaluaton he SFC-based dsk scheduler has three major components; the rregularty polcy, the starvaton polcy, and the underlyng space-fllng curve, and two parameters; the wndow sze and the expanson factor. In ths secton, we perform comprehensve experments to construct an SFC-based dsk scheduler by approprately choosng ts components and parameters. In Secton 5.1, we perform experments to evaluate all the proposed polces for mnmzng rregularty and avodng starvaton In Secton 5.2, we study the effect of each space-fllng curve on the scheduler In Secton 5.3, we study the effect of the ntal wndow sze For all experments we set the expanson factor to be 5% of. All experments n ths secton are performed wth the dsk smulaton model developed at Dartmouth College [17]. It smulates the Hewlett ackard dsk drve [23] that s descrbed n detal n [27]. hs dsk smulaton model has been wdely used n many projects, e.g., n the SmOS project at Stanford Unversty [10, 26] and n the Galley project at Dartmouth College [21]. he H dsk drve contans 1962 cylnder wth 19 tracks per cylnder. Each track contans 72 sectors wth 512 bytes each. he revoluton speed s 4002 rpm and the dsk has a SCSI-II controller nterface. o reflect the rregularty of the SFC scheduler, we measure the mean rregularty over all the space dmensons. he standard devaton of reuest watng tme s consdered as a measure of starvaton, the hgher the standard devaton the hgher the chance that starvaton may occur. For
7 Mean Irregularty (ercent) Wndow Sze (ercent) SR+ER SR+ER SS+ER SR+AE Mean Irregularty (ercent) SR+ER SR+ER SS+ER SR+AE 40 Wndow Sze (ercent) Mean Irregularty (ercent) SR+ER 90 SR+ER SS+ER SR+AE 85 Wndow Sze (ercent) St. Dev. of watng tme Wndow Sze (ercent) SR+ER SR+ER SS+ER SR+AE (a) Sweep SFC (b) Dagonal SFC (c) Gray SFC (d) Sweep SFC Fgure 8. Comparson among dfferent polces. comparson purposes, we use the FCFS scheduler as our base pont. he rregularty and the standard devaton of the watng tme are presented as a rato to the rregularty and the standard devaton of the watng tme caused by FCFS, respectvely. Recall that tradtonal dsk schedulers, e.g., EDF and SAF can be modeled as specal cases of an SFC-based dsk scheduler. Hence, we do not have to compare wth each one of them separately Selectng the olcy In ths secton, we compare the proposed algorthms n Sectons 3.2 and 3.3. All experments consder dsk reuests wth four QoS parameters that arrve exponentally wth mean nterarrval tme 25 msec. he ntal wndow sze s expressed as a percentage of the total ponts n the space. he expanson factor s set to 5% of. he notaton + s used to ndcate a combnaton of two dsk schedulng polces. For example SR+AE ndcates that the dsk scheduler uses olces SR (Serve and Resume) to handle rregularty and AE (Always Expand) to handle starvaton. Fgures 8a, 8b, and 8c gve the mean rregularty for the Sweep, Dagonal, and Gray SFCs, respectvely at dfferent values for. o smplfy the graph, we only plot SR+AE as a representatve of dsk schedulers that use polcy AE. Other dsk schedulers that use the same polcy (AE) gve the same performance as SR+AE. At =0, all the schedulers degenerate to the Fully-reemptve SFC dsk scheduler. Smlarly, at =100, all the schedulers degenerate to the Non-reemptve SFC dsk scheduler. Except for the case where =0, the AE (Always Expand) olcy results n very hgh rregularty even wth small wndow sze. he reason s that s always ncreasng and eventually t becomes large enough to block all ncomng dsk reuests as n the non-preemptve scheduler. In Fgures 8a and 8b, olcy SS gves the lowest rregu- ( larty when 1. As ncreases, more dsk reuests are blocked and stored n the dsk ueue. he blocked dsk reuests are served accordng to ther SFC order. hus, respectng the SFC-order lowers the rregularty. SR+ER and SR+ER gve reasonable ncrease n rregularty as ncreases. he Spral and eano SFCs exhbt smlar behavor as the Sweep and Dagonal SFCs. he Dagonal SFC gves the lowest rregularty for any wndow sze. However, the choce of the approprate space-fllng curve does not rely only on rregularty. Other aspects that control the choce of a space-fllng curve are nvestgated n the next secton. Fgure 8c represents the performance of the Gray, C-Scan, and Hlbert SFCs. Unlke the Sweep and Dagonal SFCs, n SR+ER and SR+ER polces, ncreasng from 0 to 40 results n lowerng the rregularty. Fgure 8d gves the standard devaton of the watng tme for the Sweep SFC. All space-fllng curves gve the same curve for watng tme. SS+ER gves very hgh standard devaton, whch ndcates a hgh possblty of starvaton. In olcy SS, dsk reuests that are blocked by wndow are accumulated and stored n the ueue. So servng them n one scan may result n starvng lower prorty reuests. SR+AE works as the non-preemptve scheduler. SR+ER and SR+ER gve lower starvaton as ncreases. As can be seen from the experments, SR+ER and SR+ER gve the best schedulng performance where they result n a moderate schedule that balances between rregularty and starvaton. However, olcy SR has a vtal drawback, that t penalzes dsk reuests for ther early arrval. Assume that a dsk reuest arrves wthn wndow, then t s stored n. he servce of s postponed tll all dsk reuests n are served. If was smart enough to delay tself so that t arrves when the blockng wndow sldes ahead so that becomes outsde and stored n, then t wll be elgble for beng served mmedately. hs scenaro hghlghts the fact that may be served better f t arrves late. hs problem s dealt wth n olcy SR, that after servng each reuest, SR checks the ueue for those reuests that become elgble to servce and move (promote) them to. For the rest of experments n the followng sectons, we use the olces SR+ER n the Condtonally- reemptve SFC dsk scheduler.
8 Mean Irregularty Sweep 30 CScan eano Gray 25 Hlbert Spral Dagonal Number of dmensons Mean Irregularty Sweep CScan eano Gray Hlbert Spral Dagonal Number of prorty levels per dmenson (a) Dmensons (b) rorty levels Fgure 9. Scalablty of SFC Scheduler Selectng the Space-Fllng Curve In ths secton, we perform comprehensve comparson between the seven space-fllng curves n Fgure 1. he objectve s to determne whch space-fllng curve wll best ft n the SFC-based dsk scheduler. All experments n ths secton are performed wth SR+ER polces Scalablty of SFC-based Schedulers In ths secton, we address the ssue of scalablty of SFCbased schedulers, e.g., when the number of dmensons (schedule parameters) ncreases or when the number of prorty levels per dmenson ncreases. he experments n ths secton are performed wth SR+ER polces wth 1, and the mean nterarrval tme of dsk reuests s 25 msec. In Fgure 9a, we measure the rregularty of the SFC-based dsk scheduler usng dfferent space-fllng curve for up to 12 QoS parameters (schedulng dmensons) where each dmenson has 16 prorty levels. he Dagonal SFC gves the best performance especally wth hgher dmensons. he Sweep, eano, and Spral SFCs have almost the same performance. Fgure 9b compares the space-flng curves n the fourdmensonal space, whle the number of prorty levels vares from 4 to 256. After 16 prorty levels, all spacefllng curves tend to exhbt constant behavor. he Dagonal SFC gves the best performance. he Hlbert and Gray SFCs have the worst performance wth respect to rregularty. he Sweep, eano, and Spral SFCs have smlar performance that tends to be eual to the performance of the C-Scan SFC n hgh prorty levels. he C-Scan SFC has constant performance regardless of the number of prorty levels. From the experments, t can be seen that the SFC-based dsk scheduler scales easly and wthout addtonal codng dffculty to hgher QoS parameters. Also when usng the approprate SFC, the SFC-based scheduler can exhbt low rregularty even at hgher dmensons. he tme complexty for convertng a pont n the -dmensonal space nto the one-dmensonal space s [20] Farness of SFC-based Schedulers A very crtcal pont for SFC-based dsk schedulers s how to assgn the QoS dsk reuest parameters (.e., the deadlne, prorty, etc.) to the dmensons of the space-fllng curve. For example, the EDF dsk scheduler can be modeled by the Sweep SFC when assgnng the vertcal dmenson (Fgure 1a) to the deadlne parameter. Also SAF can be modeled usng the Sweep or the C-Scan SFC by assgnng the vertcal dmenson to the access tme. We say that a space-fllng curve s based to dmenson f t results n low rregularty n relatve to the other dmensons. Also, we say that a space-fllng curve s far f t results n smlar rregularty for all dmensons. In ths secton, we use the standard devaton of rregularty over all the dmensons as a measure of the farness of space-fllng curves. he experment n ths secton s performed on four QoS parameters usng SR+ER polces wth 1, and the nterarrval tme of dsk reuests s 25 msec. In Fgure 10a, we measure the standard devaton of rregularty over all dmensons. A low standard devaton ndcates more farness. he Dagonal SFC s the most far space-fllng curve among the space-fllng curves we consder n ths study (the standard devaton s less than 10%). For a medum wndow sze, the Spral SFC has a very low standard devaton. he C-Scan and Sweep SFCs gve the worst performance. hs s because they have no rregularty n the last dmenson whle havng hgh rregularty n the other dmensons. Some applcatons may have only one mportant dmenson, whle the other dmensons are not wth the same sg-
9 Standard Devaton of Irregularty Sweep CScan eano Gray Hlbert Spral Dagonal 0 Wndow Sze (ercent) Irregularty ercent Sweep 40 CScan eano Gray 20 Hlbert Spral Dagonal 0 Wndow Sze (ercent) (a) Standard Devaton (b) Favored Dmenson Fgure 10. Farness of SFC Scheduler. nfcant mportance. One example s optmzng the mechancal movements of the dsk head over the cylnders. Another example s the real tme reuests, where n some applcatons the most mportant factor would be to meet the reuest deadlne, and then the other parameters can be scheduled. EDF favors the deadlne, whle gnorng all other dmensons. CSCAN favors the cylnder dmenson. SAF favors the access tme dmenson. For these applcatons, we develop the experment gven n Fgure 10b. Although, we run the experment n a four-dmensonal QoS space, we plot only the most favored dmenson for each space-fllng curve. Fgure 10b shows that the C-Scan and the Sweep SFCs are always the best for a small wndow sze. hey have no rregularty n small wndow szes. hs s also an nterpretaton of why they have very hgh standard devaton (Fgure 10a) Selectng the Intal Wndow Sze In ths set of experments, we nvestgate how the value of the wndow can be determned. We develop a desgn curve for each space-fllng curve that demonstrates the effect of changng on the rregularty and starvaton n the three-, four-, and fve-dmensonal spaces. We use the same experment as n Secton 5.1 whle varyng the number of dmensons from three to fve. Fgure 11 gves the desgn curves for the eano, Hlbert, and Dagonal SFCs, respectvely. he C-Scan and the Gray SFCs have smlar shapes as that of the Hlbert SFC. All other SFCs have smlar desgn curves as that of the eano and Dagonal SFCs wth dfferent rregularty values. Determnng the value of the wndow sze depends on the space-fllng curve. For the eano SFC, settng =35% results n the best trade-off between the rregularty and the standard devaton of watng tme. For the Hlbert and Dagonal SFCs, settng =35%, 40%, respectvely would result n the best trade-off. 6. Concluson In ths paper, we have proposed a scalable dsk schedulng algorthm for servng reuests that reure QoS parameters (.e., deadlne, prorty, etc.). he dea s to map the multple QoS parameters nto the one-dmensonal space. hen, we use the orderng mposed by space-fllng curves to serve the dsk reuests. We ntroduce the rregularty as a measure of ualty of the space-fllng curve order. We show how rregularty s lnearly correlated wth other measures of goodness for scheduler performance, e.g., dsk utlzaton, deadlne losses, and prorty nverson. he wndow sze tunng parameter s ntroduced to tune the rregularty and starvaton of an SFC-based dsk scheduler. Our comprehensve smulaton experments show that usng the dsk-schedulng algorthm SR+ER acheves the best performance for any space-fllng curve. From the set of the dscussed space-fllng curves, we show the dfferent propertes that motvates the use of each space-fllng curve. References [1] R. K. Abbot and H. Garca-Molna. Schedulng /o reuests wth deadlnes: A performance evaluaton. In roc. of the IEEE Real-me Systems Symp., RSS, pages , Florda, Dec [2] W. G. Aref, I. Kamel, and S. Ghandeharzadeh. Dsk schedulng n vdeo edtng systems. IEEE rans. on Knowledge and Data Engneerng, KDE, 13(6): , [3]. Asano, D. Ranjan,. Roos, E. Welzl, and. Wdmayer. Space-fllng curves and ther use n the desgn of geometrc data structures. heoretcal Computer Scence, CS, 181(1):3 15, 1997.
10 (a) eano (b) Hlbert (c) Dagonal Fgure 11. Desgn Curves. [4] S. Chen, J. Stankovc, J. Krouse, and D. owsley. erformance evaluaon of two dsk schedulng algorthms for real-tme systems. Journal of Real-me Systems, 3: , [5] E. G. Coffman, L. Klmko, and B. Ryan. Analyss of scannng polces for reducng seek tmes. SIAM Journal on Computng, 1(3): , Sept [6] C. Faloutsos. Multattrbute hashng usng gray codes. In roc. of the Int. Conf. on Management of data, ACM SIG- MOD, pages , Washngton D.C., May [7] C. Faloutsos and Y. Rong. Dot: A spatal access method usng fractals. In roc. of the Int. Conf. on Data Engneerng, ICDE, pages , Kobe, Japan, Apr [8] R. Gest and S. Danel. A contnuum of dsk schedulng algorthms. ACM rans. of Computer Systems, OCS, 5(1):77 92, Feb [9] G. Gbson, D. Nagle, K. Amr, J. Butler, F. W. Chang, H. Goboff, C. Hardn, E. Redel, D. Rochberg, and J. Zelenka. Fle server scalng wth network-attached secure dsks. In In roc. of the ACM Int. Conf. on Measurement and Modelng of Computer Systems, SIGMERICS, pages , Seatle, Washngton, June [10] S. A. Herrod. Usng Complete Machne Smulaton to Understand Computer System Behavour. hd thess, Stanford Unversty, Feb [11] D. Hlbert. Ueber stetge abbldung ener lne auf en flashenstuck. Mathematshe Annalen, pages , [12] M. Hofr. Dsk schedulng: Fcfs vs sstf revsted. Communcatons of the ACM, CACM, 23(11): , Nov [13] H. V. Jagadsh. Lnear clusterng of objects wth multple attrbutes. In roc. of the Int. Conf. on Management of data, ACM SIGMOD, pages , Atlantc Cty, NJ, June [14] I. Kamel and C. Faloutsos. Hlbert r-tree: An mproved r- tree usng fractals. In roc. of the 20th Int. Conf. on Very Large Data Bases, VLDB, pages , Santago, Chle, Sept [15] I. Kamel,. Nranjan, and S. Ghandeharzedah. A novel deadlne drven dsk schedulng algorthm for mult-prorty multmeda objects. In Int. Conf. on Data Engneerng, ICDE, pages , San Dego, CA, Mar [16] R. H. Katz. Hgh performance network- and channelattached storage. roceedngs of IEEE, 80(8), Aug [17] D. Kotz, S. oh, and S. Radhakrshnan. A detaled smulaton model of the hp97560 dsk drve. echncal Report CS-R94-220, Department of Computer Scence, Dartmouth College, [18] J. K. Lawder and. J. H. Kng. Queryng mult-dmensonal data ndexed usng the hlbert space fllng curve. SIGMOD Record, 30(1), Mar [19] J. K. Lenstra, A. R. Kan, and.brucker. Complexty of machne schedulng problems. Annals of Dscrete Mathematcs, 1: , [20] M. F. Mokbel and W. G. Aref. Irregularty n multdmensonal space-fllng curves wth applcatons n multmeda databases. In roc. of the Int. Conf. on Informaton and knowledge Management, CIKM, Atlanta, GA, Nov [21] N. Neuwejaar. Galley: A New arallel Fle System for Scentfc Applcatons. hd thess, Computer Scence Department, Dartmouth College, [22] J. A. Orensten. Spatal uery processng n an objectorented database system. In roc. of the Int. Conf. on Management of data, ACM SIGMOD, pages , Washngton D.C., May [23] H. ackard. H97556/58/ nch SCSI Dsk Drve, techncal reference manual, 2nd edton edton, June [24] G. eano. Sur une courbe u remplt toute une ar plane. Mathematshe Annalen, 36: , [25] A. Reddy and J. C. Wylle. Dsk schedulng n multmeda /o systems. In roc. of the 1st ACM Multmeda, pages , Anahem, CA, Aug [26] M. Rosenblum, S. Herrod, E. Wtchel, and A. Gupta. Complete computer smulaton: he smos approach. In roc. IEEE arallel and Dstrbuted echnology, [27] C. Ruemmler and J. Wlkes. An ntroducton to dsk drve modelng. In roc. IEEE Computer, 27(3):17 28, Mar [28] A. Slberchatz and. Galvn. Operatng System Conceps. Addson-Wesley, 5th edton, [29] L. Velho and J. Gomes. Dgtal halftonng wth space fllng curves. Computer Graphcs, 25(4):81 90, July 1991.
Hybrid Transcoding for QoS Adaptive Video-on-Demand Services
732 IEEE Transactons on Consumer Electroncs, Vol. 50, No. 2, MAY 2004 Hybrd Transcodng for QoS Adaptve Vdeo-on-Demand Servces Ilhoon Shn and Kern Koh Abstract Transcodng s a core technque that s used n
More informationInstructions for Contributors to the International Journal of Microwave and Wireless Technologies
Instructons for Contrbutors to the Internatonal Journal of Mcrowave and Wreless Technologes Frst A. Author 1, Second Author 1,2, Thrd Author 2 1 Cambrdge Unversty Press, Ednburgh Buldng, Shaftesbury Road,
More informationA Comparative Analysis of Disk Scheduling Policies
A Comparatve Analyss of Dsk Schedulng Polces Toby J. Teorey and Tad B. Pnkerton Unversty of Wsconsn* Fve well-known schedulng polces for movable head dsks are compared usng the performance crtera of expected
More informationSimon Sheu Computer Science National Tsing Hua Universtity Taiwan, ROC
Mounr A. Tantaou School of Electrcal Engneerng and Computer Scence Unversty of Central Florda Orlando, FL 3286-407-823-393 tantaou@cs.ucf.edu Interacton wth Broadcast Vdeo Ken A. Hua School of Electrcal
More informationLOW-COMPLEXITY VIDEO ENCODER FOR SMART EYES BASED ON UNDERDETERMINED BLIND SIGNAL SEPARATION
LOW-COMPLEXITY VIDEO ENCODER FOR SMART EYES BASED ON UNDERDETERMINED BLIND SIGNAL SEPARATION Jng Lu, Fe Qao *, Zhjan Ou and Huazhong Yang Department of Electronc Engneerng, Tsnghua Unversty ABSTRACT Ths
More informationFollowing a musical performance from a partially specified score.
Followng a muscal performance from a partally specfed score. Bryan Pardo and Wllam P. Brmngham Artfcal Intellgence Laboratory Electrcal Engneerng and Computer Scence Dept. and School of Musc The Unversty
More informationDecision Support by Interval SMART/SWING Incorporating. Imprecision into SMART and SWING Methods
Decson Support by Interval SMART/SWING Incorporatng Imprecson nto SMART and SWING Methods Abstract: Interval judgments are a way of handlng preferental and nformatonal mprecson n multcrtera decson analyss.
More informationError Concealment Aware Rate Shaping for Wireless Video Transport 1
Error Concealment Aware Rate Shapng for Wreless Vdeo Transport 1 Trsta Pe-chun Chen and Tsuhan Chen 2 Abstract Streamng of vdeo, whch s both source- and channel- coded, over wreless networks faces the
More informationQUICK START GUIDE v0.98
QUICK START GUIDE v0.98 QUICK HELP Q A 1 STEP BY STEP 3 GLOSSARY 2 A B C 1 INSTALLATION 1. Make sure that the hardware nstallaton s performed by a certfed vendor 2. Install OTOTRAK app from Apple s App
More informationThe UCD community has made this article openly available. Please share how this access benefits you. Your story matters!
Provded by the author(s) and Unversty College Dubln Lbrary n accordance wth publsher polces., Please cte the publshed verson when avalable. tle Dynamc Complexty Scalng for Real-me H.264/AVC Vdeo Encodng
More informationA Scalable HDD Video Recording Solution Using A Real-time File System
H. L et al.: A Scalable HDD Vdeo Recordng Soluton Usng A Real-tme Fle System A Scalable HDD Vdeo Recordng Soluton Usng A Real-tme Fle System Hong L, Stephen R. Cumpson Member, IEEE, Robert Jochemsen, Jan
More informationImproving Reliability and Energy Efficiency of Disk Systems via Utilization Control
Ths paper appeared n the Proceedngs of the 2th IEEE Symposum on Computers and Communcatons (ISCC'08, Marrakech, Morocco, July 2008. Improvng Relablty and Energy Effcency of Dsk Systems va Utlzaton Control
More informationSystem of Automatic Chinese Webpage Summarization Based on The Random Walk Algorithm of Dynamic Programming
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 205, 9, 35-322 35 Open Access System of Automatc Chnese Webpage Summarzaton Based on The Random Walk Algorthm
More informationAnalysis of Subscription Demand for Pay-TV
Analyss of Subscrpton Demand for Pay-TV Manabu Shshkura Researcher Insttute for Informaton and Communcatons Polcy 2-1-2 Kasumgasek, Chyoda-ku Tokyo 110-8926 Japan m-shshkura@soumu.go.jp Tel: 03-5253-5496
More informationColor Monitor. L200p. English. User s Guide
Color Montor L200p User s Gude Englsh Frst Edton (February / 2003) Note : For mportant nformaton, refer to the Montor Safety and Warranty manual that comes wth ths montor. Contents ENGLISH Safety (Read
More informationcurrent activity shows on the top right corner in green. The steps appear in yellow
Browzwear Tutorals Tutoral ntroducton Ths tutoral leads you through the best practces of color ways operatons usng an llustrated step by step approach. Each slde shows the actual applcaton at the stage
More informationAccepted Manuscript. An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time
Accepted Manuscrpt An mproved artfcal bee colony algorthm for flexble ob-shop schedulng problem wth fuzzy processng tme Ka Zhou Gao, Ponnuthura Nagaratnam Suganthan, Quan Ke Pan, Tay Jn Chua, Chn Soon
More informationStudy on the location of building evacuation indicators based on eye tracking
Study on the locaton of buldng evacuaton ndcators based on eye trackng Yue L Tsnghua Unversty yue-l5@malstsnghuaeducn Png hang Tsnghua Unversty zhangp@malstsnghuaeducn Hu hang Tsnghua Unversty, zhhu@tsnghuaeducn
More informationSimple VBR Harmonic Broadcasting (SVHB)
mple VBR Harmonc Broadcastng (VHB) Hsang-Fu Yu ab, Hung-hang Yang a, Y-Mng hen c, -Mng Tseng a, and hen-y Kuo a a Dep. of omputer cence & Informaton Engneerng, atonal entral Unversty, Tawan b omputer enter,
More informationOptimized PMU placement by combining topological approach and system dynamics aspects
Optmzed PU placement by combnng topologcal approach and system dynamcs aspects Jonas Prommetta, Jakob Schndler, Johann Jaeger Insttute of Electrcal Energy Systems Fredrch-Alexander-Unversty Erlangen-Nuremberg
More informationT541 Flat Panel Monitor User Guide ENGLISH
T541 Flat Panel Montor User Gude ENGLISH Frst Edton (June / 2002) Note : For mportant nformaton, refer to the Montor Safety and Warranty manual that comes wth ths montor. Ths publcaton could contan techncal
More informationtj tj D... '4,... ::=~--lj c;;j _ ASPA: Automatic speech-pause analyzer* t> ,. "",. : : :::: :1'NTmAC' I
ASPA: Automatc speech-pause analyzer* D. GERVERt and G. DNELEY Unversty of Durham, Durham, England ASPA: The Programs Snce the actual detals of nterface samplng, dsk storage routnes, etc., wll depend upon
More informationRIAM Local Centre Woodwind, Brass & Percussion Syllabus
8 RIAM Local Centre Woodwnd, Brass & Percusson Syllabus 2015-2018 AURAL REQUIREMENTS AND THEORETICAL QUESTIONS REVISED FOR ALL PRACTICAL SUBJECTS AURAL TESTS From Elementary to Grade V ths area s worth
More informationStatistics AGAIN? Descriptives
Cal State Northrdge Ψ427 Andrew Answorth PhD Statstcs AGAIN? What do we want to do wth statstcs? Organze and Descrbe patterns n data Takng ncomprehensble data and convertng t to: Tables that summarze the
More informationTRADE-OFF ANALYSIS TOOL FOR INTERACTIVE NONLINEAR MULTIOBJECTIVE OPTIMIZATION Petri Eskelinen 1, Kaisa Miettinen 2
Internatonal Conference 20th EURO Mn Conference Contnuous Optmaton and Knowledge-Based Technologes (EurOPT-2008) May 20 23, 2008, Nernga, LITHUANIA ISBN 978-9955-28-283-9 L. Saalausas, G.W. Weber and E.
More informationReduce Distillation Column Cost by Hybrid Particle Swarm and Ant
From the SelectedWorks of Dr. Sandp Kumar Lahr Summer July 20, 2016 Reduce Dstllaton Column Cost by Hybrd Partcle Swarm and Ant Dr. Sandp k lahr chnmaya lenka Avalable at: https://works.bepress.com/sandp_lahr/33/
More informationAN INTERACTIVE APPROACH FOR MULTI-CRITERIA SORTING PROBLEMS
AN INTERACTIVE APPROACH FOR MULTI-CRITERIA SORTING PROBLEMS A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF MIDDLE EAST TECHNICAL UNIVERSITY BY BURAK KESER IN PARTIAL FULFILLMENT
More informationWhy Take Notes? Use the Whiteboard Capture System
Why Take Notes? Use the Whteboard Capture System L-we He Zhengyou Zhang and Zcheng Lu September, 2002 Techncal Report MSR-TR-2002-89 Mcrosoft Research Mcrosoft Corporaton One Mcrosoft Way Redmond, WA 98052
More informationAMP-LATCH* Ultra Novo mm [.025 in.] Ribbon Cable 02 MAR 12 Rev C
AMP-LATCH* Ultra Novo Applcaton Specfcaton Receptacle Connectors for 114-40056 0.64 mm [.025 n.] Rbbon Cable 02 MAR 12 All numercal values are n metrc unts [wth U.S. customary unts n brackets]. Dmensons
More informationCost-Aware Fronthaul Rate Allocation to Maximize Benefit of Multi-User Reception in C-RAN
Cost-Aware Fronthaul Rate Allocaton to Maxmze Beneft of Mult-User Recepton n C-RAN Dora Bovz, Chung Shue Chen, Sheng Yang To cte ths verson: Dora Bovz, Chung Shue Chen, Sheng Yang. Cost-Aware Fronthaul
More informationCorrecting Image Placement Errors Using Registration Control (RegC ) Technology In The Photomask Periphery
Correctng Image Placement Errors Usng Regstraton Control (RegC ) Technology In The Photomask Perphery Av Cohen 1, Falk Lange 2 Guy Ben-Zv 1, Erez Gratzer 1, Dmtrev Vladmr 1 1. Carl Zess SMS Ltd., Karmel
More information3 Part differentiation, 20 parameters, 3 histograms Up to patient results (including histograms) can be stored
st Techncal Specfcatons Desgned n France Wth a rch past and a professonal experence bult-up over 35 years, SFRI s a French nvatve company commtted to developng preon In Vtro Dst solutons. SFRI has bult
More informationA STUDY OF TRUMPET ENVELOPES
A STUDY OF TRUMPET ENVELOPES Roger B. Dannenberg, Hank Pellern, and Istvan Dereny School of Computer Scence, Carnege Mellon Unversty Pttsburgh, PA 15213 USA rbd@cs.cmu.edu, hank.pellern@andrew.cmu.edu,
More informationTechnical Information
CHEMCUT Techncal Informaton CORPORATION Introducton The Chemcut CC8000 etcher has many new features desgned to reduce the cost of manufacturng and, just as mportantly, the cost of ownershp. Keepng the
More informationIntegration of Internet of Thing Technology in Digital Energy Network with Dispersed Generation
Amercan Scentfc Research Journal for Engneerng, Technology, and Scences (ASRJETS) ISS (Prnt) 2313-4410, ISS (Onlne) 2313-4402 Global Socety of Scentfc Research and Researchers http://asrjetsjournal.org/
More informationCraig Webre, Sheriff Personnel Division/Law Enforcement Complex 1300 Lynn Street Thibodaux, Louisiana 70301
DATE OF APPLCATON: Craig Webre, Sheriff Personnel Division/Law Enforcement Complex 1300 Lynn Street Thibodaux, Louisiana 70301 N GENERAL EMAL ADDRESS: For Local Calls - (985) 532-4380 (985) 446-2255 (985)
More informationSmall Area Co-Modeling of Point Estimates and Their Variances for Domains in the Current Employment Statistics Survey
Small Area Co-Modelng of Pont Estmates and Ther Varances for Domans n the Current Employment Statstcs Survey Jule Gershunskaya, Terrance D. Savtsky U.S. Bureau of Labor Statstcs FCSM, March 2018 Dsclamer:
More informationTHE IMPORTANCE OF ARM-SWING DURING FORWARD DIVE AND REVERSE DIVE ON SPRINGBOARD
THE MPORTANCE OF ARM-SWNG DURNG FORWARD DVE AND REVERSE DVE ON SPRNGBOARD Ken Yokoyama Laboratory of Bomechancs Faculty ofeducaton Kanazawa Unversty Kanazawa, Japan J unjro Nagano Department of Physcal
More informationAnchor Box Optimization for Object Detection
Anchor Box Optmzaton for Object Detecton Yuany Zhong 1, Janfeng Wang 2, Jan Peng 1, and Le Zhang 2 1 Unversty of Illnos at Urbana-Champagn 2 Mcrosoft Research 1 {yuanyz2, janpeng}@llnos.edu, 2 {janfw,
More informationDetecting Errors in Blood-Gas Measurement by Analysiswith Two Instruments
CLIN. CHEM. 33/4, 512-517 (1987) Detectng Errors n Blood-Gas Measurement by Analysswth Two Instruments LouIs F. Metzger, Wllam B. Stauffer, Ann V. Kruplnskl, Rchard P. MIIlman,3 George S. Cembrowskl,2
More informationUser s manual. Digital control relay SVA
User s manual Dgtal control relay DISIBEINT ELECTRONIC S.L, has been present n the feld of the manufacture of components for the ndustral automaton for more than years, and mantans n constant evoluton
More informationMODELING AND ANALYZING THE VOCAL TRACT UNDER NORMAL AND STRESSFUL TALKING CONDITIONS
MODELING AND ANALYZING THE VOCAL TRACT UNDER NORMAL AND STRESSFUL TALING CONDITIONS Ismal Shahn and Naeh Botros 2 Electrcal/Electroncs and Comuter Engneerng Deartment Unversty of Sharjah, P. O. Box 27272,
More informationClock Synchronization in Satellite, Terrestrial and IP Set-top Box for Digital Television
Clock Synchronzaton n Satellte, Terrestral and IP Set-top Box for Dgtal Televson THESIS Submtted n partal fulflment of the requrements for the degree of DOCTOR OF PHILOSOPHY by MONIKA JAIN Under the Supervson
More informationThe Traffic Image Is Dehazed Based on the Multi Scale Retinex Algorithm and Implementation in FPGA Cui Zhe1, a, Chao Li2, b *, Jiaqi Meng3, c
3rd Internatonal Conference on Mechatroncs and Industral Informatcs (ICMII 2015) The Traffc Image Is Dehazed Based on the Mult Scale Retnex Algorthm and Implementaton n FPGA Cu Zhe1, a, Chao L2, b *, Jaq
More informationProduction of Natural Penicillins by Strains of Penicillium chrysogenutn
Producton of Natural Pencllns by Strans of Pencllum chrysogenutn a J. FUSK and ЬЕ. WELWRDOVÁ ^Department of Mcrobology and Bochemstry, Slovak Techncal Unversty, Bratslava b Botka, Slovenská Ľupča Receved
More informationConettix D6600/D6100IPv6 Communications Receiver/Gateway Quick Start
Conettx / Communcatons Recever/Gateway Quck Start.0 Parts Lst able : Conettx System Components Qty. Descrpton Conettx Communcatons Recever/Gateway AC power cord Battery cable P660 I/O cable P660 Rack mount
More informationModeling Form for On-line Following of Musical Performances
Modelng Form for On-lne Followng of Muscal Performances Bryan Pardo 1 and Wllam Brmngham 2 1 Computer Scence Department, Northwestern Unversty, 1890 Maple Ave, Evanston, IL 60201 2 Department of Math and
More informationNovel Quantization Strategies for Linear Prediction with Guarantees
Smon S. Du* Ychong Xu* Yuan L Hongyang Zhang Aart Sngh Pulkt Grover Carnege Mellon Unversty, Pttsburgh, PA 15213, USA *: Contrbute equally. SSDU@CS.CMU.EDU YICHONGX@CS.CMU.EDU LIYUANCHRISTY@GMAIL.COM HONGYANZ@CS.CMU.EDU
More informationFailure Rate Analysis of Power Circuit Breaker in High Voltage Substation
T. Suwanasr, M. T. Hlang and C. Suwanasr / GMSAR Internatonal Journal 8 (2014) 1-6 Falure Rate Analyss of Power Crcut Breaker n Hgh Voltage Substaton Thanapong Suwanasr, May Thandar Hlang and Cattareeya
More informationCritical Path Reduction of Distributed Arithmetic Based FIR Filter
Crtcal Path Reducton of strbuted rthmetc Based FIR Flter Sunta Badave epartment of Electrcal and Electroncs Engneerng.I.T, urangabad aharashtra, Inda njal Bhalchandra epartment of Electroncs and Telecommuncaton
More informationSimple Solution for Designing the Piecewise Linear Scalar Companding Quantizer for Gaussian Source
94 J. NIKOIĆ, Z. PERIĆ,. VEIMIROVIĆ, SIMPE SOUTION FOR DESIGNING THE PIECEWISE INEAR SCAAR Smle Soluton for Desgnng the Pecewse near Scalar Comandng Quantzer for Gaussan Source Jelena NIKOIĆ, Zoran PERIĆ,
More informationScalable Multimedia Disk Scheduling
Scalable Multimedia Disk Scheduling Mohamed F. Mokbel 1 Walid G. Aref 1 Khaled Elbassioni 2 Ibrahim Kamel 2 1 Department of Computer Sciences, Purdue University, West Lafayette, IN 4797-1398 2 Panasonic
More informationProduct Information. Universal swivel units SRU-plus
Product Informaton Unversal swvel unts SRU-plus SRU-plus Unversal swvel unts Robust. Fast. Hgh Performance. SRU-plus unversal rotary actuator Unversal unt for pneumatc swvel and turnng movements. Feld
More informationA Quantization-Friendly Separable Convolution for MobileNets
arxv:1803.08607v1 [cs.cv] 22 Mar 2018 A Quantzaton-Frendly Separable for MobleNets Abstract Tao Sheng tsheng@qt.qualcomm.com Xaopeng Zhang parker.zhang@gmal.com As deep learnng (DL) s beng rapdly pushed
More informationLost on the Web: Does Web Distribution Stimulate or Depress Television Viewing?
Lost on the Web: Does Web Dstrbuton Stmulate or Depress Televson Vewng? Joel Waldfogel The Wharton School Unversty of Pennsylvana August 10, 2007 Prelmnary comments welcome Abstract In the past few years,
More informationINSTRUCTION MANUAL FOR THE INSTALLATION, USE AND MAINTENANCE OF THE REGULATOR GENIUS POWER COMBI
NSTRUCTON MANUAL FOR THE NSTALLATON, USE AND MANTENANCE OF THE REGULATOR GENUS POWER COMB (TRANSLATON OF THE ORGNAL NSTRUCTON MANUAL N TALAN) PRELMNARY VERSON WARRANTY The devce s guaranteed 24 months
More informationQuantization of Three-Bit Logic for LDPC Decoding
Proceedngs of the World Congress on Engneerng and Computer Scence 2011 Vol II, October 19-21, 2011, San Francsco, USA Quantzaton of Three-Bt Logc for LDPC Decodng Raymond Moberly and Mchael E. O'Sullvan
More informationarxiv: v1 [cs.cl] 12 Sep 2018
Powered by TCPDF (www.tcpdf.org) Neural Melody Composton from Lyrcs Hangbo Bao, Shaohan Huang 2, Furu We 2, Le Cu 2, Yu Wu 3, Chuanq Tan 3, Songhao Pao, Mng Zhou 2 School of Computer Scence, Harbn Insttute
More informationModular Plug Connectors (Standard and Small Conductor)
Modular Plug Connectors (Standard and Small Conductor) Applcaton Specfcaton 114-6016 04 APR 11 All numercal values are n metrc unts [wth U.S. customary unts n brackets]. Dmensons are n mllmeters [and nches].
More informationProduct Bulletin 40C 40C-10R 40C-20R 40C-114R. Product Description For Solvent, Eco-Solvent, UV and Latex Inkjet and Screen Printing 3-mil vinyl films
Product Bulletn 40C Revson D, Effectve February 2016 (Replaces C, Apr. 15) 40C-10R 40C-20R 40C-114R Product Descrpton For Solvent, Eco-Solvent, UV and Latex Inkjet and Screen Prntng 3-ml vnyl flms Quck
More informationSealed Circular LC Connector System Plug
Sealed Crcular LC Connector System Plug Instructon Sheet Kt 1828618- [ ], Receptacle Kt 1828619- [ ], 408-10079 and EMI Receptacle Kt 1985193- [ ] 07 APR 11 Plug Kt 1828618 -[ ] Cable Fttng Receptacle
More informationFPGA Implementation of Cellular Automata Based Stream Cipher: YUGAM-128
ISSN (Prnt) : 2320 3765 ISSN (Onlne): 2278 8875 Internatonal Journal of Advanced Research n Electrcal, Electroncs and Instrumentaton Engneerng An ISO 3297: 2007 Certfed Organzaton Vol. 3, Specal Issue
More informationSKEW DETECTION AND COMPENSATION FOR INTERNET AUDIO APPLICATIONS. Orion Hodson, Colin Perkins, and Vicky Hardman
SKEW DETECTION AND COMPENSATION FOR INTERNET AUDIO APPLICATIONS Oron Hodson, Coln Perkns, and Vcky Hardman Department of Computer Scence Unversty College London Gower Street, London, WC1E 6BT, UK. ABSTRACT
More informationProduct Information. Miniature rotary unit ERD
Product Informaton ERD ERD Fast. Compact. Flexble. ERD torque motor Powerful torque motor wth absolute encoder and electrc and pneumatc rotary feed-through Feld of applcaton For all applcatons wth exceptonal
More informationMulti-Line Acquisition With Minimum Variance Beamforming in Medical Ultrasound Imaging
IEEE Transactons on Ultrasoncs, Ferroelectrcs, and Frequency Control, vol. 60, no. 12, Decemer 2013 2521 Mult-Lne Acquston Wth Mnmum Varance Beamformng n Medcal Ultrasound Imagng Ad Ranovch, Zv Fredman,
More informationUser Manual. AV Router. High quality VGA RGBHV matrix that distributes signals directly. Controlled via computer.
User Manual AV Router Hgh qualty VGA RGBHV matrx that dstrbutes sgnals drectly. Controlled va computer. Notce: : The nmaton contaned n ths document s subject to change wthout notce. SmartAVI makes no warranty
More informationProduct Information. Universal swivel units SRU-plus 25
Product Informaton SRU-plus Robust. Fast. Hgh Performance. SRU-plus unversal rotary actuator Unversal unt for pneumatc swvel and turnng movements. Feld of applcaton Can be used n ether clean or contamnated
More informationSONG STRUCTURE IDENTIFICATION OF JAVANESE GAMELAN MUSIC BASED ON ANALYSIS OF PERIODICITY DISTRIBUTION
SOG STRUCTURE IDETIFICATIO OF JAVAESE GAMELA MUSIC BASED O AALYSIS OF PERIODICITY DISTRIBUTIO D. P. WULADARI, Y. K. SUPRAPTO, 3 M. H. PUROMO,,3 Insttut Teknolog Sepuluh opember, Department of Electrcal
More informationProduct Information. Manual change system HWS
Product Informaton HWS HWS Flexble. Compact. Productve. HWS manual change system Manual tool change system wth ntegrated ar feed-through and optonal electrc feed-through Feld of applcaton Excellently sutable
More informationProduct Information. Manual change system HWS
Product Informaton HWS HWS Flexble. Compact. Productve. HWS manual change system Manual tool change system wth ntegrated ar feed-through and optonal electrc feed-through Feld of applcaton Excellently sutable
More informationLoewe bild 7.65 OLED. Set-up options. Loewe bild 7 cover Incl. Back cover. Loewe bild 7 cover kit Incl. Back cover and Speaker cover
Product nformaton Loewe bld 7.65 Page of March 07 Loewe bld 7.65 OLED EU energy effcency class: B Screen dagonal (n cm) / Screen dagonal (n nch): 64 / 65 Power consumpton ON (n W): 80 Annual energy consumpton
More informationAIAA Optimal Sampling Techniques for Zone- Based Probabilistic Fatigue Life Prediction
AIAA 2002-383 Optmal Samplng Technques or Zone- Based Probablstc Fatgue Le Predcton M. P. Enrght Southwest Research Insttute San Antono, TX H. R. Mllwater Unversty o Texas at San Antono San Antono, TX
More informationCONNECTIONS GUIDE. To Find Your Hook.up Turn To Page 1
CONNECTIONS GUIDE To Fnd Your Hook.up Turn To Page 1 Connectng TV to Antenna (or Cable Wthout Cable Box) and No VCR (Hook-up 1A)...2 Monaural VCR (Hook-up 1B)...3 Stereo VCR (Hook-up 1C)... 4 Cable Wth
More informationAcademic Standards and Calendar Committee Report # : Proposed Academic Calendars , and
Unversty of Rhode sland DgtalCommons@UR Blls 2004 Academc Standards and Calendar Commttee Report #2003041: Proposed Academc Calendars 200708, 200809 and 200910 Unversty of Rhode sland Follow ths and addtonal
More informationCONNECTIONS GUIDE. To Find Your Hook.up Turn To Page 1
CONNECTIONS GUIDE To Fnd Your Hook.up Turn To Page 1 Connectng TV to Antenna (or Cable Wthout Cable Box) and No VCR (Hook-up 1A)... 2 Monaural VCR (Hook-up 1B)... 3 StereoVCR (Hook-up 1C)... 4 Cable Wth
More informationBachelor s Degree Programme (BDP)
EEG-01/ BEGE-101 Bachelor s Degree Programme (BDP) ASSIGNMENT (for July 2018 and January 2019 Sessons) EEG-01/BEGE-101 ELECTIVE COURSE IN ENGLISH School of Humantes Indra Gandh Natonal Open Unersty Madan
More information(12) Ulllted States Patent (10) Patent N0.: US 8,269,970 B2 P0lid0r et a]. (45) Date of Patent: Sep. 18, 2012
US008269970B2 (12) Ulllted States Patent (10) Patent N0.: P0ld0r et a]. (45) Date of Patent: Sep. 18, 12 (54) OPTICAL COMPARATOR WITH DIGITAL 6,945,652 B2 9/05 sakqta et a1 GAGE 7,058,109 B2* 6/06 Davs.....
More informationPatrolling Mechanisms for Disconnected Targets in Wireless Mobile Data Mules Networks
20 Internatonal Conerence on arallel rocessn atrolln Mechansms or Dsconnected Tarets n Wreless Moble Data Mules Networs Chh-Yun Chan, Chh-Yu Ln, Cehn-Yu Hseh, and Y-Jun Ho Taman Unverst, Tae, Tawan cchan@mal.tu.edu.tw,
More informationFast Intra-Prediction Mode Decision in H.264/AVC Based on Macroblock Properties
Fast Intra-Predcton Mode Decson n H.264/AVC Based on Macroblock Propertes Abstract Intra-predcton s a wdely used tecnque n ntra codng. H.264/AVC adopts rate-dstorton optmzaton (RDO) tecnque to obtan te
More informationAutomated composer recognition for multi-voice piano compositions using rhythmic features, n-grams and modified cortical algorithms
Complex Intell. Syst. (2018) 4:55 65 https://do.org/10.1007/s40747-017-0052-x ORIGINAL ARTICLE Automated composer recognton for mult-voce pano compostons usng rhythmc features, n-grams and modfed cortcal
More informationS Micro--Strip Tool in. S Combination Strip Tool ( ) S Cable Holder Assembly (Used only
Instructon Sheet LghtCrmp* Plus LC 408-10103 (for Jacketed Cable) Connectors 18 AUG 09 Rear Protectve Cap Termnaton CoverG Boot Connector Assembly Crmp Eyelet Duplex Clp G Connector kt s shpped wth these
More informationIN DESCRIBING the tape transport of
Apparatus For Magnetc Storage on Three-Inch Wde Tapes R. B. LAWRANCE R. E. WILKINS R. A. PENDLETON IN DESCRIBING the tape transport of the DATAmatc 1, t s perhaps well to begn by revewng the nfluental
More informationEnvironmental Reviews. Cause-effect analysis for sustainable development policy
Envronmental Revews Cause-effect analyss for sustanable development polcy Journal: Envronmental Revews Manuscrpt ID er-2016-0109.r2 Manuscrpt Type: Revew Date Submtted by the Author: 24-Feb-2017 Complete
More informationUser guide. Receiver-In-Ear hearing aids. resound.com
User gude Recever-In-Ear hearng ads resound.com 400786011US-17.07-Rev.A.ndd 1 20-07-2017 12:52:40 Left Hearng Ad Rght Hearng Ad Seral number Seral number Model number Model number Recever type Recever
More informationPrinter Specifications
: Characterfonts:! Fort Pont 7P 0.5 pl Ptch 5cpl, Ocpl, 2cpl Proptlonel Epson Draf!o 0 lo j Epson Cower 0 0 0 Epson Roman O O O 0 Epson San6 Sent 0 O O O Epson Presllge j0 0 ~Epson Scnpt O 0 Epson Sormt
More informationzenith Installation and Operating Guide HodelNumber I Z42PQ20 [ PLASHATV
Installaton and Operatng Gude HodelNumber I Z42PQ20 PLASHATV To vew the extended verson of owner's manual that contans the advanced features of ths TV set, vst our webste at http://www.enthservce.com Ths
More informationUser Manual ANALOG/DIGITAL, POSTIONER RECEIVER WITH EMBEDDED VIACCESS AND COMMON INTERFACE
User Manual ANALOG/DIGITAL, POSTIONER RECEIVER WITH EMBEDDED VIACCESS AND COMMON INTERACE CONTENTS. Safety nstructons -------------------------------------------------------------------. eatures -------------------------------------------------------------------------------.
More informationLoewe bild 5.55 oled. Modular Design Flexible configuration with individual components. Set-up options. TV Monitor
Product nformaton Loewe bld 5.55 oled Page of 3 Loewe bld 5.55 oled EU energy effcency class: B Screen dagonal (n cm) / Screen dagonal (n nch): 39 / 55 Power consumpton ON (n W): 50 Annual energy consumpton
More informationDT-500 OPERATION MANUAL MODE D'EMPLOI MANUAL DE MANEJO MANUAL DE OPERA(_._,O. H.-,lri-D PROJECTOR PROJECTEUR PROYECTOR PROJETOR
TM PROJECTOR PROJECTEUR PROYECTOR PROJETOR DT-500 OPERATION MANUAL MODE D'EMPLOI MANUAL DE MANEJO MANUAL DE OPERA(_._,O 8 f f 8 H.-,lr-D _I_H DEFINmON_TIM_IA I_T_RFACE Before usng the projector, please
More informationTurn it on. Your guide to getting the best out of BT Vision
Avalable n Bralle, large prnt and audo CD. Please call FREE on 8 8 15 for your copy. Turn t on Your gude to gettng the best out of www.bt.com/btvson V.2 28656 Enchantng flms to entertan all the famly Flms
More informationA question of character. Loewe Connect ID.
A queston of character. Loewe Connect ID. Modern. Etquette you can learn, character s nnate. You make a clear dstncton between good manners and genune style. Your s s lke yourself: unfussy, busnesslke
More informationUser guide. Receiver-In-The-Ear hearing aids, rechargeable Hearing aid charger. resound.com
User gude Recever-In-The-Ear hearng ads, rechargeable Hearng ad charger resound.com 400973011US-18.08-Rev.A.ndd 1 01-08-2018 14:18:12 Left Hearng Ad Rght Hearng Ad Seral number Seral number Model number
More informationExpressive Musical Timing
Axel Berndt, Tlo Hähnel Department of Smulaton and Graphcs Otto-von-Guercke Unversty of Magdeburg {aberndt tlo}@sg.cs.un-magdeburg.de Abstract. Tmng s crucal for the qualty of expressve musc performances.
More informationCASH TRANSFER PROGRAMS WITH INCOME MULTIPLIERS: PROCAMPO IN MEXICO
FCND DP No. 99 FCND DISCUSSION PAPER NO. 99 CASH TRANSFER PROGRAMS WITH INCOME MULTIPLIERS: PROCAMPO IN MEXICO Elsabeth Sadoulet, Alan de Janvry, and Benjamn Davs Food Consumpton and Nutrton Dvson Internatonal
More informationUser guide. Receiver-In-The-Ear hearing aids, rechargeable Hearing aid charger. resound.com
User gude Recever-In-The-Ear hearng ads, rechargeable Hearng ad charger resound.com Seral number Model number Recever type Left Hearng Ad Low Power Medum Power Hgh Power Ultra Power Seral number Model
More informationDiscussion Paper Series
Doshsha Unversty Center for the Study of the Creatve Economy Dscusson Paper Seres No. 2013-04 Nonlnear Effects of Superstar Collaboraton: Why the Beatles Succeeded but Broke Up Tadash Yag Dscusson Paper
More informationManagement of Partially Safe Buffers
394 EEE TRANSACTONS ON COMPUTERS, VOL. 44, NO. 3, MARCH 1995 Management of Partay Safe Buffers Sedat Akyrek and Kenneth Saem, Member, EEE Computer Socety AbstPactAhfe RAM s RAM whch has been made as reabe
More informationJTAG / Boundary Scan. Multidimensional JTAG / Boundary Scan Instrumentation. Get the total Coverage!
JTAG / Boundary Scan Multdmensonal JTAG / Boundary Scan Instrumentaton IEEE 1149.6 IEEE 1149.1 IEEE 1149.7 Multdmensonal JTAG / Boundary Scan Instrumentaton IEEE 1149.4 IEEE 1532 Get the total Coverage!
More informationStep 3: Select a Class
R Step 1: Roll Ablty Scores a. ndcate dce-rollng method (p. 13):. Roll 3d6 sx tmes, n order. 11. Roll 3d6 twce per ablty, select ether. 111. Roll 3d6 sx tmes and assgn to abltes as desred. V. Roll 3d6
More informationQ. YOU SAY IN PARAGRAPH 3 OF THlf PAPER THAT YOU'VE
"t... _. ------- -~---------.--~-.-...-------.."-.-"---.~,-~.-".--.---..-..-.~-.--~.~-------"..---+-...---" --_... l... l.... BY MR. MURRY: 0. Q. BUT YOU DON'T REMEMBER THE ST~TSTCAL DFFERENCE STTNG HERE
More information