Getting the System Sizing and Performance Test Right

Size: px
Start display at page:

Download "Getting the System Sizing and Performance Test Right"

Transcription

1 Getting the System Sizing and Pefomance Test Right Steve Hazeltine - Sema Gou Systems Ltd. (now Oacle UK Ltd.) ( shazelti@uk.oacle.co - Telehone ) Andew Johnston - Indeendent Consultant and Sema Gou Associate ( andewj@comuseve.com - Telehone ) 1. Intoduction This document descibes how we secified the Sun seve equied fo the oted Rental Systems at Livingston UK. Livingston is the Euoean leade in oviding sevices to uses of electonic equiment and comutes. A imay business activity is the ental of electonic equiment and comutes, much of which is conducted ove the telehone, so esonse times ae key to the business. We theefoe had to be sue that the new system would efom at least as well as the old one without wasting money though ove-secified hadwae. The execise was a comlete success. We wee able to educe ou oiginal hadwae estimates by ove 200,000 fom the manufactue s ecommendations, and fom day one the system was faste than its elacement. The obseved CPU and memoy usage figues demonstate that we ocued exactly the ight secification fo the client. Ou aoach had a numbe of additional benefits to Livingston, including being able to accuately edict, and thus educe, the numbe of Oacle licenses equied. The key to the success was: undestanding the imotance of efomance to the client, and constucting an aoach which met thei needs, taking measuements fom the old system to geneate the eal use equiements and tansaction volumes, exeienced staff using this data to select the equied latfom, using a combination of a simulato and live uses to ovide a ealistic efomance test, to validate ou aoach befoe oceeding to live unning. Because it elies on having an existing system in lace, this aoach is not alicable to evey situation. Today, howeve, the elacement of an old system is obably moe common than the ceation of a comletely fesh alication, so we hoe ou exeiences will be of some use to othes. 2. Aoach to Secifying the Hadwae Thee ae a numbe of aoaches to hadwae secification, including: aoximate sizing based on the numbe of uses, and the ecommendations of hadwae manufactues, tansaction ocessing and othe benchmak based sizing, Getting the System Sizing Steve Hazeltine and Andew Johnston Page 1

2 comaison with simila existing systems, ototye based benchmaking. The choice of aoach should be based on: undestanding the vaious otions, the cost of estimating the size of the latfom, the isks to the sulie and client of mis-sizing the latfom. Cost is imotant. A ototying execise is not chea, and fo a small numbe of uses it may be bette to make an aoximate sizing calculation and ove-secify the hadwae. Uses aely comlain about a system unning too quickly. Fo a lage system, the isks need to be undestood, and thei cost evaluated. If an extenal sulie is involved, both aties need to be clea on who will bea the cost if the isks mateialise. These could include: the cost of a hadwae ugade, aticulaly significant if the selected model is at the to of a ange, cutting back to the oiginal system, and eeating the system imlementation, consequential loss of business and client s image, loss of faith in the oject by uses, who may not be willing to give the IT deatment o sulie a second chance. We had the following situation: efomance was citical to sales uses, cutting back to the old system would have caused immense disution to the business, with otential loss of sales, evious exeiences had been vey ainful, both fo individuals and the business, we had conflicting signals fom ou initial assessment of the tansaction ate (which suggested quite a small system), and the advice of the hadwae manufactues based on the numbe of uses, which suggested a vey much lage system. We had to get it ight fist time, and it was clea we could not ely on evious exeience and manufactues data alone, so a ototye based aoach was selected. The ocess we adoted is summaised in the figue below: Measue Load and Pefomance of Existing System Measue efomance and esouce usage of key tansactions in ototye Calculate equied CPU, memoy and disk fo live latfom Select Live Platfom Validate choice with eeated measuements and fomal efomance test Getting the System Sizing Steve Hazeltine and Andew Johnston Page 2

3 3. Measuing the Tansaction Load 3.1 Identifying the Key Tansactions We stated the sizing execise with vey little eliable data: The numbe of concuent uses was high (otentially > 100), which suggested a lage system, The numbe of enquiies and odes ocessed e day was elatively low, suggesting a much smalle system. We theefoe ealised we had to find some key indicatos which would allow us to secify the efomance much moe accuately, with the following chaacteistics: The old and new system achitectues wee entiely diffeent (moving fom a oietay database on Data Geneal hadwae unning AOS/VS, to an Oacle7 database unning unde Unix). Theefoe low-level figues elated to hysical system attibutes (e.g. %CPU loading) could not easily be comaed between the achitectues. Vey high-level business tansactions (such as the numbe of new odes e day) would be useful in comaing total volumes of business, but not much use fo measuing subjective efomance which is elated to individual ocessing actions. The key tansaction timings would have to be meaningful (to allow them to be elated to the uses equiements), and accuately and easily measuable (fo an exactly comaable ocess) on both the existing and oted system. We would not have a comlete oted system until quite late in the oject, so we would have to size the system using a elatively small subset of the tansactions. The tansactions would have to be tyical of live usage. In most systems, a small gou of functions ae used most of the time, and these should fom the basis of the ototye. Futhemoe, you need to simulate a eesentative mix of ead and wite accesses, acoss a eesentative section of the database and disk. Fotunately, we identified a small gou of tansactions (a cycle though fom a sales enquiy to ode confimation) which wee suoted by the ealy ilot of the oting execise and which satisfied these citeia vey well. The cycle contained key tansactions fo which the uses had secified taget esonse times: oduct queies, custome queies, and the time taken to finish ocessing a confimed ode. The same enquiy sceens could geneate quey-only tansactions, allowing the mix of quey and udate accesses to the database to be contolled. 3.2 Measuing the Existing Usage We stated by veifying the numbe of active uses on the system. An initial manual assessment (walking aound at a busy time with a cliboad) suggested that the numbe of uses actively loading the system was a vey small ecentage of those logged in: Getting the System Sizing Steve Hazeltine and Andew Johnston Page 3

4 Activity No. In Sceen & Active 6 Sceen (Passive) 11 Sceen (Inactive) 15 At Menu 20 Oeatos/testes 9 Total 61 We tied to distinguish between those uses obviously woking fom the data on the sceen (assive) and those whee the system had been left sitting in a sceen but thee was not obviously anyone using the data, o thee was no data on sceen (inactive). Allowing fo eos, the numbe of active (and assive) sceen uses was aound 17 ± 4 (out of 60+ logged on). This could not only account fo the conflict between the initial estimates, but would also suggest much lowe licensing and memoy equiements. Howeve, the figues wee ehas too low to be believed, and needed to be confimed moe scientifically. We also needed to measue the numbes of each key tansaction and the actual efomance deliveed by the old system. A shot attemt at using manual measuements oved only that the tansaction timings vaied consideably, and the mix of tansactions in the system was much boade than we had been lead to believe, so we could not just geneate enquiies and ode confimations and hoe this would mimic live use. Fotunately the Data Geneal system ovided a athe elegant solution to ou oblems, in the fom of an otional log of all sceen activity fo each use session duing a time eiod. We could then elay these logs and obseve both what the uses had been doing, and the times taken fo key tansactions. Simila mechanisms exist in most oeating systems, o can be simulated using standad test tools. The only emaining oblem was the volume of data this would geneate. In the end we used ou test tool (see the next chate) to automate elaying the logs and to assess which function, on which sceen, each use was efoming. All such combinations wee classified as a database ead, database udate, o ignoed action (such as navigation fom sceen back to menu ). As we elayed the logs the time stams wee used to both time key tansactions and assess when use sessions wee left inactive fo a eiod of time. The figues fom these measuements boadly suoted the ealie estimates, but with a few inteesting asects: Thee was a wide vaiation in the aeas and functions used, with no obvious ule, The numbe of active uses was slightly highe than the manual measuements had suggested, but still less than half those logged on at any time, Database quey actions outstied those which would geneate an udate by a facto of aound 2.5:1, Most key tansactions on the old system wee comleted within the taget times, but with quite a wide vaiation. 3.3 Establishing the Real Tagets Having established an accuate analysis of the numbe of tansactions of vaious tyes thoughout the day (on a few chosen days), we then had to set the tagets fo the new system. Thee wee a numbe of adjustment factos which each had to be taken into account: Getting the System Sizing Steve Hazeltine and Andew Johnston Page 4

5 Gowth - we had to size the system to allow fo a few yeas in a gowing business, Othe uses - we had to conside the inceased system loading which might come fom the intoduction of moe flexible eoting tools, bette intefaces with the OA softwae, ossible access fom othe Euoean sites, netwok management and system monitoing and a numbe of othe such changes, Oeato and develoe activity - command line sessions wee not catued by the logging tool, Business volume - the measuements wee taken duing a quiet month in business tems (a nomal seasonal vaiation due to summe holidays). We couldn t wait fo business to ick u, but we could comae the numbe of odes being ocessed on the measuement days with the eak values fom a few months ealie, Geate sead of functions - we could only simulate a subset of tansactions, and a geate sead in eality would undoubtedly decease efomance due to, fo examle, educed data cacheing, Losses in the measuement ocess - fo examle, we had to beak the logging down into one hou sessions, and lost about seven minutes esetting the system befoe continuing with the next. This inevitably distubed the analysis of things like inactive sessions and the daily totals of tansactions, The wost-case numbe of active uses was calculated as follows: Peak fom Automated Measuements 21 Add maximum eo on measuements 4 Add 60% fo business volume adjustment 15 Add 2 fo oeato/develoe access 2 Maximum Concuent Uses 42 We also decided that the new seve would have to suot a load equivalent to oughly 3700 quey tansactions e hou, deived as follows: Maximum load obseved in tests 1276 Allow 10% fo measuement eos 128 Add 20% fo oeato/develoe access 255 Subtotal 1659 Business adjustment (atio of measued business to ast eak) of 50% gives 2488 Allow gowth facto of 50% to give 3732 Taget quey tansaction ate 3732 Fom the obseved slit between quey and udate tansactions, we noted that the test load would have to include at least 1500 udate tansactions e hou. The equiement was that at this level, 90% of oduct and custome queies and 90% of ode confimations should comlete within the defined tagets. Ou measuements also confimed that these would be a small imovement comaed with the existing system. 4. Building and Measuing the Pototye In ode to un a ototying/benchmaking execise of this sot, you have to do seveal things: Getting the System Sizing Steve Hazeltine and Andew Johnston Page 5

6 1. Choose, souce and set u the hadwae, 2. Choose and develo / set u the test tools, 3. Develo o ot key ats of the taget system, 4. Measue the efomance of the ototye, 5. Secify the eal latfom, 6. Plan and un the efomance tests. You may be constained by decisions which have aleady been made. In ou case, these constaints existed but actually made the job slightly easie. It had aleady been decided that the taget system would be a Sun seve, unning Solais and Oacle7, because of Sema Gou s evious good exeience of this envionment and Livingston s business elationshi with Sun. Futhemoe, the oting execise was aleady unde way, so we had at of the system, albeit incomlete and atially tested, to wok with fom a vey ealy stage. 4.1 Choosing the Pototye Envionment You have to have access to adequate hadwae and softwae to make the execise meaningful. Thee ae vaious obvious souces: develoment equiment, sale o etun ageements, and loans fom the manufactues may be feasible, but uchase is obably the last otion. Given the natue of ou client, we went fo the othe obvious solution - ental. This is a vey good solution and allows the exloation of a numbe of otions, within limits. Unless you test envionment is exactly what you lan fo live use, you then have to decide what is easonable to extaolate fom these tests, and what should not be extaolated. In ou case, we knew that we would be using the same CPU achitectue and we wee confident that we could use the manufactue s CPU efomance figues to comae one model with anothe. On the othe hand, we had decided fo esilience easons that the live system would use a RAID disk aay, but none was available fo us to test. Since we wee confident the system would not be disk bound we decided to isk extaolating figues fom a diffeent disk achitectue, but this might not have been wise in a disk-bound system. You also need to ovide a sufficient latfom to un the test tool(s) themselves. As well as a Sun SacStation unning the taget alication, we needed 4 Pentium PCs unning Windows 95 dedicated to contolling the tests, simulating the load and stoing the esults. As a geneal ule you should ty to avoid test tools which un on the taget machine itself unless you ae confident you can assess thei own imact on efomance. 4.2 Choosing / Develoing the Test Tools The choice of test tools vaies with the alication. We identified a numbe of key equiements elated to ou situation: The alication was esented though a chaacte-mode teminal emulato unde Windows, so ou test tool had to wok with that envionment, To allow vaiations in the tests deending on the esonse of the taget system, the test tool had to include a sciting language of some sot, The tool had to be able to inteet the sceen of the teminal emulato as an 80*25 aay, not just a text contol with a sting in it, Given the lage volume of data, the tool had to be able to wite esults away to stuctued Getting the System Sizing Steve Hazeltine and Andew Johnston Page 6

7 stoage, ideally a PC database, We would have to be able to un seveal test sessions simultaneously fom a single PC, to make unning a sufficient numbe of simulated sessions acticable. Suisingly, we could not find a commecial test tool which met these equiements. The main oblem seemed to be the ability to inteet text within a teminal emulato window, but the ability to wite esults to a database was also lacking in many otions we looked at. Thus we decided to wite ou own! While this should not be undetaken lightly, in ou case it tuned out to be a vey effective solution. We used Visual Basic, which could use DDE to communicate intelligently with the emulato, could wite its esults diectly to an Access database, and used Windows messages to synchonise between diffeent test ocesses. The initial scits we wote to inteet the logs fom the Data Geneal ovided most of the coe functions to decide what the alication was doing, and it was then quite simle to join these togethe with new code diving the alication itself. We also develoed a elated tool to catue keystokes and commentay text, so that exets on the alication could develo the famewok of each test without needing any exetise with the test tool itself. We found that a test cycle coveing about 10 sceens could be ecoded and develoed into a woking test outine in about 1-2 days. Since (with the level of automation) it was easy to do so, we eeated the efomance tests on seveal occasions: when the chosen live latfom became available, with vaious secification client PCs, and when the oted system was functionally comlete. This built u confidence in ou decisions, and ointed the way to some efomance imovements in the alication, and the coect client PC secification. 4.3 Measuing the Pefomance of the Pototye The efomance load simulation was a outine which dove the oted alication in a eeating cycle of enquiy, ode confimation, some geneal enquiies, deleting the eviously ceated ode, and some moe geneal enquiies. The cycle, vaious oduct and custome seaches, and the ode confimation ocess wee each timed and esults witten to the esults database. Analysing this outine in the same way as the existing system showed that each cycle geneated 54 quey tansactions and 23 udates. The test PC could dive u to eight theads - sessions on the taget system. Thee wee fou aametes which affected the actual load geneated: Numbe of test theads, The Shot Delay - a delay of a few seconds inseted between each gou of a few keystokes to simulate natual oeato enty seed (and allow the system to esond), The Long Delay - a maximum delay (in seconds) between eetitions of the cycle, Numbe of eetitions - this mainly affected the duation of a test to make sue that the esults wee statistically viable. By vaying these factos we could simulate widely vaying test loads. The behaviou of the ototye system was then assessed using thee factos: The numbe of quey tansactions e hou (deived fom the aveage ode cycle time and the numbe of theads unning), Getting the System Sizing Steve Hazeltine and Andew Johnston Page 7

8 Whethe the timed tansactions comleted in a satisfactoy time, Whethe the taget Unix host s efomance monitoing tools eoted satuation of CPU and/o disk I/O. The following table summaises the esults of ou ototye test against ou develoment SacStation (a 110MHz Sac 5): Test Run Numbe of Theads Shot Delay Long Delay Cycle Time Quey Tx e Hou Poduct Seach Custome Seach Ode Confim CPU Usage :02: % :03: % :05: % :07: % :06: % :07: % The disk I/O aely exceeded 15% of maximum thoughout all the tests, but the 3 and 4 thead figues showed CPU usage aoaching satuation, and the 4 thead figues showed seach times stating to exceed the taget. Fom this we concluded the following: efomance should not be disk bound, but we wee obably getting unealistic data cacheing and would need a bette sead of functions in the final efomance test, The SacStation 5 could suot u to about 1750 tansactions e hou (keeing machine usage and tansaction times within tagets), so the CPU of the live machine would have to be about 2.5 times this oweful. 5. Secifying the Live Platfom The aim is to oduce a latfom secification in tems of model numbe, numbe and seed of CPUs, memoy size, disk achitectue and caacity. The inuts to this ocess ae: the CPU, memoy and disk esouces consumed by the ototye, the tansaction load and esonse times suoted by the ototye, the equied esonse time and tansaction load, esilience equiements (which may dictate exta CPU o memoy caacity, o a cetain disk achitectue), memoy and disk sizing guidelines fom hadwae and / o database sulies. The following sections ovide some guidelines, esecially fo ocesso sizing, based on ou exeiences. Getting the System Sizing Steve Hazeltine and Andew Johnston Page 8

9 5.1 Identifying the Bottlenecks You must eview you ototye to ensue that thee ae no excetional cicumstances, such as the database being vey ooly tuned, o the test hadwae being so shot on memoy that swaing and aging occued at vey low loads. If the test hadwae can comfotably suot the exected live load, you may be able to educe the secification. Othewise, you will have to identify the bottlenecks in efomance, and hence decide what needs to change: With a lightly loaded machine unning only a few tansaction tyes (whee most data will be cached) the esonse time eesents the time fo one ocesso and the disks to comlete one tansaction. You should see little disk ead activity, and CPU activity oughly ootional to the tansaction load. Inceasing the numbe of ocessos will not imove the individual esonse times, but inceasing individual ocesso owe/ seed will. In actice, available ocesso seeds tyically vay by less than a facto of 2:1 at any one time. Theefoe, if the esonse time of a lightly loaded ototye is inadequate, the cue is to modify the softwae design, not to exect geat imovements fom faste hadwae. If as the load inceases, the disk activity emains accetable, esonse times will incease as the obability of any one ocess having to wait fo othe active ocesses inceases. If the ocesso load gets too high (geneally above 75-80% on most Unix systems) excessive swaing will cause the esonse to wosen damatically. The onset of this can be delayed by faste o additional ocessos. If disk efomance is the bottleneck, this will show itself eithe as an inability to fully load the CPUs when unning a highe tansaction load, o a damatically wosening esonse as the mix of tansactions is inceased to educe cacheing. You may need to look at altenative disk achitectues, vey much moe memoy (to extend the effects of data cacheing), o softwae otimisation. If unde the same cicumstances aging activity becomes vey high then the system is memoy bound. You will have to secify a lage amount of memoy fo the eal system, and extaolate fom moe lightly loaded figues. Altenatively, memoy is one esouce which you should be able to ent o boow to check the effects of a lage quantity. It is usually a false economy to unde-secify the memoy on a machine whee the CPU and disk can suot bette efomance. In ou case, we found that disk and memoy activity wee accetable u to the limit of the tansaction load ou test machine s CPU could suot. We wee theefoe able to secify the live machine as a ootional incease in CPU and memoy caacity, with a disk achitectue deived fom the esilience equiements. 5.2 Selecting the Pocesso(s) The following shows how to: select a ocesso seed that ensues that a lightly loaded machine will give an adequate esonse time, calculate how many ocessos you need to suot the exected eak tansaction load. We use the following tems: c CPU ating (e.g. clock seed) of the ototye s ocesso CPU ating (e.g. clock seed) of the live ocesso c Getting the System Sizing Steve Hazeltine and Andew Johnston Page 9

10 f c P t t Adjustment fo the effects of a eal load comaed with the highe cacheing of a tyical simulated load Numbe of ocessos in the seve measued ototye esonse time of the most citical tansaction (e.g. with the slowest execution seed) equied esonse time of the same tansaction in 90% of cases tansaction load suoted (at <80% CPU Loading) by the ototye eak tansaction load edicted fo the live system, including any gowth o adjustment factos You can make an initial estimate of the equied ocesso owe/seed as: c c >= 11. The facto of 1.1 allows fo an exected incease in aveage esonse time when the ocesso has a easonable (40%) loading. If a ocesso of this seed/owe is not available, the emedy lies in changing the softwae, not in hadwae. The equied numbe of ocessos is then given by the atio of the eak tansaction ate to the tansaction ate suoted (at a easonable CPU loading) by the ototye: P >= fct c ct This gives the (factional) numbe of CPUs that would be fully loaded by the system. f c is a facto to allow fo non-key tansactions not included in the ototye, and othe asects which will make the eal tansaction mix moe heteogeneous than simulated in the ototye. In ou case, we found that a small numbe of tansactions accounted fo aound 60% of the load, and teated the emainde as being equivalent in total to the main sales enquiy tansaction. Thus we estimated a value of 1.5 fo f c. The next ste is to comae otential ocesso configuations fom the manufactue s liteatue that will meet the efomance goal. Fo each otential configuation, you should use the above equations to check that the esonse time will be accetable and the suoted eak tansaction ate adequate: 11. c c <= and ct P fc c >= t Given a ange of accetable altenatives, you final choice will then be based on: ice, elative exected esonse times, likely tansaction load gowth ove the oject lifetime. Getting the System Sizing Steve Hazeltine and Andew Johnston Page 10

11 Ou Poject Exeience In ou oject, we had aleady decided on Sun Micosystems as the hadwae sulie. The measuements on the existing system showed two eak loading times: aound noon when sales activity was at a eak, and ealy evening when desatch was ocessing the day s odes (but sales activity was educed). We calculated the load fo both cases, and concluded that the geatest CPU usage was in the moning. The key tansaction fo esonse time had been identified as a oduct enquiy. The ototye measuements and above calculations showed that: the minimum individual CPU owe could not be less than 75% that of a 110Mhz Sac 5, the total CPU owe should be at least 2.5 times that of the 110Mhz Sac 5. This immediately allowed us to conside the less exensive Sac 20 ange athe than the moe exensive Sac 1000 (caable of taking significantly moe ocessos). Without the ototye, we would not have been able to make this economy with confidence. Thee wee thee main otions: 1. two 50MHz ocessos 2. fou 50MHz ocessos 3. two 70MHz ocessos Of these, the loading fo the 2x50MHz configuation was too high fo comfot. A 4x50MHz unit would have been able to suot inceased thoughut, and theefoe suot geate shottem oganisational gowth, but the 2x70MHz otion offeed bette esonse times, with bette exansion otential in the medium to long tem. The decision was theefoe taken to ocue that configuation, as a fast esonse time in the shot to medium tem was moe imotant than shot-tem gowth. This would suot the business bette, even though it had a lowe secification in simle Secmaks. 5.3 Memoy Sizing The guidelines fo memoy sizing ae usually elated to the numbe of uses. As we noted above, many of the uses on the old Livingston system wee logged in fo long eiods but efomed elatively few tansactions. We could theefoe use as a basis the measued numbe of active, athe than concuent uses. Amed with this numbe we stated with the standad guidelines fo a tyical Unix/Oacle installation: Souce Memoy (Mb) Unix 32 Live database: 40 active 3Mb each 120 Test database 16 CQCS 4GL: Mb Each 20 TOTAL 188 Fom exeience, we wee awae that memoy size is citical in Oacle efomance, and any exta memoy would be useful. We also had to allow fo gowth and othe ocesses (such as monitoing softwae). We theefoe decided to buy 256Mb of RAM, safe in the knowledge that if this was substantially ove-secified any exta could be deloyed on anothe installation. Getting the System Sizing Steve Hazeltine and Andew Johnston Page 11

12 Whee a decision like this is bodeline, but good efomance is essential fom the outset, the ental otion is vey actical. Exta memoy can be ented, and the system should go live with this additional memoy in lace. Use the efomance measuing tools to decide if the memoy is being used. If not, etun the excess to the ental comany. If it is needed, extend the ental until new memoy can be bought. This guaantees efomance at a much lowe cost than outight uchase. 5.4 Secifying the Disks Sizing the Disks Disk sizing is coveed in standad texts and manuals (e.g. the DBA guide fo Oacle), and will not be coveed hee, excet fo a coule of salutay tales: Ou fist estimate of disk sizing was based on two good numbes: an estimate based on the known numbes of ows in each table in the old system, with a facto of thee fo indexing; and some knowledge of the disk sizes in the old Data Geneal system. We wee theefoe athe suised to find that the fist-cut imot into Oacle occuied ove thee times this volume of disk, o almost ten times the size of the aw data. This was due to a numbe of factos: A vey denomalised data stuctue, Lage achive tables than we had been led to believe, A data stuctue enfoced by the 4GL in which most fields in the database wee of fixed length and NOT NULL, even if usually emty. Most of ou new database was emty sace! This tye of oblem is athe insidious: it can haen by default as the esult of a low-level decision outside you diect contol, and it will have a majo cumulative effect. In ou case, if affects not only database sizing, but also efomance, size and seed of backus, and so on. To limit any isk to the oting execise, we decided to live with the stuctue in the shot-tem, but ae now ogessively making manual changes to educe this effect. Othe factos to conside in disk sizing ae the following: Use files and alication softwae will gow in size, no matte how good you intentions to contol them. This is aticulaly tue in the PC aena. You will lose moe to fomatting and the oeating system than you edict. In ou case, we had decided on a RAID aay fo the main disks of the live system, and found that we lost 10-20% to aw disk fomatting, and anothe 20% to the RAID oeations, so that the available size is only about 65% of the total. Othe oeating systems have diffeent featues, but with simila effects. The message is simle: be geneous in sizing you disks, o make sue you have an achitectue in which you can easily at least double you disk caacity if equied. Estimating the Numbe and Seed of Disks To ensue efomance, it is imotant to have enough disks of sufficient seed available. While unning the ototye, you should un a disk monitoing utility (sa o efmete ae adequate unde Unix). You should ensue that you ototye database is sufficiently lage and choice of data sufficiently andom to make the data cacheing as ealistic as ossible. Getting the System Sizing Steve Hazeltine and Andew Johnston Page 12

13 You will need the following data fom the ototye: disk usage (tyically a ecentage) duing a fixed eiod, numbe of hysical and logical eads and wites ove the same eiod. Look at the atio of logical to hysical eads and wites. It is easonable fo small tables and indexes to be cached, and you ae tying to tune fo the best atio ossible. Howeve, if you get a atio in excess of 4:1 you ae obably getting moe cacheing than you will see in eal use. Fom the manufactues statistics you should be able to calculate the aoximate time taken to ead o wite a block of data, D: D= (mean seek time) + 0.5*(otation time) + (block size)/(eak tansfe ate) As a confidence check, you may be able to see a limit to the numbe of hysical eads o wites e second when the system is heavily loaded: this will be oughly 1/D. Given the ocessing times D and D fo the ototye and oosed live disk systems esectively, the stes ae vey simila to those fo ocesso secification. 1. Review the degee of caching in the ototye comaed to the live system. To do this, conside which tables and indexes should be cached, and efe to the code in you ototye. Conside also how much sae memoy you may have. 2. Ensue that the live system s disk ocessing time satisfies (D /D ) < ( / ), othewise you may have a oblem with individual tansaction times even if the oveall tansaction load can be handled. 3. Calculate the numbe of disks N equied to handle the eak tansaction load in a fashion analogous to the calculation of numbe of ocessos: fcdt N >= Dt Note that because disk ae mechanical devices, they ae slow, and that additional disk delays can have a vey maked effect on efomance. Most manufactues ecommend that disk loading in oeational systems is ket unde 40%. To achieve this, we would ecommend at this stage aiming fo a loading of unde 25% - so take a value of t whee this is tue. 4. In you database design and when setting u the system, stie o distibute the live database acoss at least N sindles, so that each is equally used, and so that none of those disks fom a bottleneck. 5. Remembe to conside the eliability asects. Note the manufactue s guidelines and you standads fo location of oeating system softwae. In aticula, you may want to ensue that tansaction logging uses a seaate disk to ensue that the database can be ecoveed in case of a disk cash. You may need to allow fo seaate disks fo this, and you may want to stie it acoss seveal disks to ensue adequate thoughut to the logs. Howeve, in ou exeience with Oacle one logging disk is obably sufficient unless you have a vey heavy tansaction ocessing system. In ou oject, we found that disk loading was usually vey low. Fo eliability uoses we went fo a RAID aay in which the disk seek times wee adequate, and thoughut fom the RAID aay was much highe than we equied due to the stiing fom the RAID 5 configuation emloyed. Note that because ou system is dominated by quey tansactions, the eduction in efomance fom a RAID 5 configuation is not a oblem. In cases whee a Getting the System Sizing Steve Hazeltine and Andew Johnston Page 13

14 highe ootion of tansactions ae udates, othe disk configuations might be moe aoiate. 6. Doing the Real Pefomance Test Befoe live use, we caied out a efomance test which would be moe eesentative of live oeation. This was based on the automated test, but with the following changes: the oiginal test cycle was sulemented by two moe to execise othe ats of the system and educe the effects of data cacheing, a lage numbe of sessions wee simulated in which vey few tansactions wee geneated, but the system was navigated fom sceen to sceen at andom to simulate the exected inactive and assive uses, a few uses wee invited efomed a few tansactions while the system was unde load, to veify that the obseved efomance was in fact accetable. The automated test suite was used to geneate a load oughly equivalent to the edicted eak (including an allowance of 50% fo eos and gowth), and fou eal uses joined in. The conclusion was that the system was noticeably slowe than when unloaded, but vey definitely bette than the Data Geneal unde heavy load, and always accetable. The cut-ove to live oeation went well, without any significant efomance oblems, and was also judged a success. In live use thee have been a few oblems elated to a small numbe of athe extensive and inefficient eots, which ae being addessed by making these moe efficient. In geneal, howeve, the system has efomed well, desite eventually being a much lowe secification than the hadwae manufactues would have ecommended fom the simle numbes of uses. 7. Conclusions We have leaned a numbe of lessons fom this execise: You need to choose you aoach caefully. This ototye-based execise cost aound 20k. Offset against this wee notional savings of aound 200k against the oiginal oosals fo hadwae and licensing, and a vey eal (but less quantifiable) value in educing the isk to the business and the oject by getting it ight fist time. Thus in ou case the costs wee well justified. If you don t ototye, you have two eal otions: ovesecify the hadwae (which may not cost too much in some smalle systems), o take the best guess fom the available documentation, and manage the isk. Know what you need to measue, and get good fist-hand measuements of all significant asects of any existing system and you ototye. Do not tust data which you haven t gatheed o checked diectly - as with ou database sizing unfoeseen factos can have damatic effects, aticulaly when comaing vey diffeent achitectues. Concentate on the factos which ae likely to be a bottleneck in you system. In ou case, the disks wee likely to be good enough, but we needed to get the ocessos ight. In a disk-bound system this would have to be evesed. Do make sue you ototye coves a ange of uses. In hindsight, we should have built eoting oeations into ous, and we would then have identified ealy some asects which have caused oblems, as well as making the cacheing and memoy usage moe ealistic. Getting the System Sizing Steve Hazeltine and Andew Johnston Page 14

15 Be eaed to invest in good test tools. Ou aoach, witing ou own, should not be aoiate o necessay in evey case. Howeve, you should define the equiements fo these tools caefully, and be eaed to be inventive to make the tools ovide you with the data you actually need. Do get the uses involved in the efomance tests. Howeve, don t ely on lage amounts of manual inut - it s difficult to contol, and difficult to eeat. An automated test suite will ove to have a numbe of uses duing the develoment and imlementation. The method we have descibed woked well in ou case. It is not a substitute fo a documented analysis of usage, ojected gowth and equied efomance but it is a way of deiving them whee a evious system exists. Neithe does this method emove the equiement fo skilled system design, but it will educe some of the isks if oely used. A efomance ototye like ous could be even moe useful whee the achitectue of a system is moe comlicated. Ove the yeas, we have both seen systems fail because the sizing and efomance testing wee not ight. In this case, we did get it ight, and hoefully this ae will hel you to size you system coectly. Getting the System Sizing Steve Hazeltine and Andew Johnston Page 15

Integrated Dynamic Congestion Controller Andreas Pitsillides 1, Petros Ioannou 2, Loukas Rossides 1

Integrated Dynamic Congestion Controller Andreas Pitsillides 1, Petros Ioannou 2, Loukas Rossides 1 Integated Dynamic Congestion Contolle Andeas Pitsillides 1, Petos Ioannou 2, Loukas Rossides 1 Abstact--The gowing demand of comute usage equies efficient ways of managing netwok taffic in ode to avoid

More information

Multidimensional Testing

Multidimensional Testing Multidimensional Testing QA appoach fo Stoage netwoking Yohay Lasi Visuality Systems 1 Intoduction Who I am Yohay Lasi, QA Manage at Visuality Systems Visuality Systems the leading commecial povide of

More information

Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson

Lecture 8 Introduction to Pipelines Adapated from slides by David Patterson Lectue 8 Intoduction to Pipelines Adapated fom slides by David Patteson http://www-inst.eecs.bekeley.edu/~cs61c/ * 1 Review (1/3) Datapath is the hadwae that pefoms opeations necessay to execute pogams.

More information

Trinocular Stereo using Shortest Paths and the Ordering Constraint

Trinocular Stereo using Shortest Paths and the Ordering Constraint Tinocula Steeo using Shotest Paths and the Odeing Constaint Motilal Agawal and Lay S. Davis Deatment of Comute Science, Univesity of Mayland, College Pak, MD 20742, USA email: mla,lsd @umiacs.umd.edu Abstact

More information

UCB CS61C : Machine Structures

UCB CS61C : Machine Structures inst.eecs.bekeley.edu/~cs61c UCB CS61C : Machine Stuctues Lectue SOE Dan Gacia Lectue 28 CPU Design : Pipelining to Impove Pefomance 2010-04-05 Stanfod Reseaches have invented a monitoing technique called

More information

A Novel Genetic Algorithm for Static Task Scheduling in Distributed Systems

A Novel Genetic Algorithm for Static Task Scheduling in Distributed Systems Intenational Jounal of Comute Theoy and Engineeing, Vol., No., Ail 200 A Novel Genetic Algoithm fo Static Task Scheduling in Distibuted Systems Ami Masoud Rahmani and Mojtaba Rezvani Abstact The static

More information

ESTIMATION OF INTERPOLATION ERROR IN DEMS USING STATISTICAL METHODS

ESTIMATION OF INTERPOLATION ERROR IN DEMS USING STATISTICAL METHODS ESTIMATION OF INTERPOLATION ERROR IN DEMS USING STATISTICAL METHODS Robet PAQUET, Austalia Key wods: DEM, inteolation eo, ALS, hotogammety, Delaunay tiangulation SUMMARY To wok with DEMs euies a knowledge

More information

Any modern computer system will incorporate (at least) two levels of storage:

Any modern computer system will incorporate (at least) two levels of storage: 1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe

More information

Aggregating Local Descriptors for Epigraphs Recognition

Aggregating Local Descriptors for Epigraphs Recognition Aggegating Local Descitos fo Eigahs Recognition Giusee Amato, Fabizio Falchi, Fausto Rabitti, Lucia Vadicamo ISTI-CNR, via G. Mouzzi, 5624 Pisa (Italy) Emails: .@isti.cn.it Abstact. In this

More information

Fault-Tolerant Metric Vector Routing

Fault-Tolerant Metric Vector Routing Fault-Toleant Metic Vecto Routing Joge A. Cobb Deatment of Comute Science Univesity of Texas at Dallas Richadson, TX 75083-0688 jcobb@utdallas.edu Abstact We esent a distibuted outing otocol fo obtaining

More information

3/1/18. Overview. Program Representations. Abstract Syntax Tree (AST) Eclipse JDT. Java Model. The Tree Structure of Java Project[2]

3/1/18. Overview. Program Representations. Abstract Syntax Tree (AST) Eclipse JDT. Java Model. The Tree Structure of Java Project[2] Oveview Pogam Reesentations Abstact Syntax Tee Eclise JDT Java Model Eclise JDT AST Contol Flow Gah Pogam Deendence Gah Points-to Gah Call Gah 2 Abstact Syntax Tee (AST) Ceated by the comile at the end

More information

COSC 6385 Computer Architecture. - Pipelining

COSC 6385 Computer Architecture. - Pipelining COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped

More information

THE THETA BLOCKCHAIN

THE THETA BLOCKCHAIN THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent

More information

Defining and Implementing Dynamic Semantics of Object Oriented High Level Petri Nets

Defining and Implementing Dynamic Semantics of Object Oriented High Level Petri Nets Defining and Imlementing Dynamic Semantics of Object Oiented High Level Peti Nets Maius Bezovan Faculty of Automation Comutes and Electonics, Univesity of Caiova 1100 Caiova, Romania Abstact. This ae deals

More information

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

Congestion Control for Differentiated-Services using Non-linear Control Theory

Congestion Control for Differentiated-Services using Non-linear Control Theory Congestion Contol fo Diffeentiated-Sevices using Non-linea Contol Theoy Andeas Pitsillides 1, Petos Ioannou 2, Loukas Rossides 1 Deatment of Comute Science, Univesity of Cyus, andeas.itsillides@ucy.ac.cy,

More information

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

Exploring non-typical memcache architectures for decreased latency and distributed network usage.

Exploring non-typical memcache architectures for decreased latency and distributed network usage. Syacuse Univesity SURFACE Electical Engineeing and Compute Science Technical Repots College of Engineeing and Compute Science 9-5-20 Exploing non-typical memcache achitectues fo deceased latency and distibuted

More information

Computer Vision - Histogram Processing. Dr. S. Das IIT Madras, CHENNAI - 36

Computer Vision - Histogram Processing. Dr. S. Das IIT Madras, CHENNAI - 36 Comute Viion - Hitogam Poceing D. S. Da IIT Mada, CHENNAI - 36 HISTOGRAM In a gay level image the obabilitie aigned to each gay level can be given by the elation: n, N Inut image,,2...l - - The nomalized

More information

Assessment of Track Sequence Optimization based on Recorded Field Operations

Assessment of Track Sequence Optimization based on Recorded Field Operations Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment

More information

An Efficient Trusted Computing Base for Routing in MANET s

An Efficient Trusted Computing Base for Routing in MANET s G. Kishna Kishoe et al, / (IJCSIT) Intenational Jounal of Comute Science and Infomation Technologies, Vol. 2 (5), 2011, 1940-1946 An Efficient Tusted Comuting Base fo Routing in MANET s G.Kishna Kishoe

More information

COEN-4730 Computer Architecture Lecture 2 Review of Instruction Sets and Pipelines

COEN-4730 Computer Architecture Lecture 2 Review of Instruction Sets and Pipelines 1 COEN-4730 Compute Achitectue Lectue 2 Review of nstuction Sets and Pipelines Cistinel Ababei Dept. of Electical and Compute Engineeing Maquette Univesity Cedits: Slides adapted fom pesentations of Sudeep

More information

Lecture #22 Pipelining II, Cache I

Lecture #22 Pipelining II, Cache I inst.eecs.bekeley.edu/~cs61c CS61C : Machine Stuctues Lectue #22 Pipelining II, Cache I Wiewold cicuits 2008-7-29 http://www.maa.og/editoial/mathgames/mathgames_05_24_04.html http://www.quinapalus.com/wi-index.html

More information

Pledge: Signature:

Pledge: Signature: S/PM 0 Final Exam 7 May 005 Name: KEY E-mail ID: @viginia.edu Pledge: Signatue: Thee ae 80 minutes 3 hous fo this exam and 80 oints on the test; don t send too long on any one uestion! Thee is an exam

More information

User Specified non-bonded potentials in gromacs

User Specified non-bonded potentials in gromacs Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of

More information

Module 6 STILL IMAGE COMPRESSION STANDARDS

Module 6 STILL IMAGE COMPRESSION STANDARDS Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Simulating Life of Virtual Plants, Fishes and Butterflies

Simulating Life of Virtual Plants, Fishes and Butterflies Simulating Life of Vitual Plants, Fishes and Butteflies 1 3 Simulating Life of Vitual Plants, Fishes and Butteflies Hansudi Nose, Daniel Thalmann Comute Gahics Lab, Swiss Fedeal Institute of Technology

More information

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,

More information

Using SPEC SFS with the SNIA Emerald Program for EPA Energy Star Data Center Storage Program Vernon Miller IBM Nick Principe Dell EMC

Using SPEC SFS with the SNIA Emerald Program for EPA Energy Star Data Center Storage Program Vernon Miller IBM Nick Principe Dell EMC Using SPEC SFS with the SNIA Emeald Pogam fo EPA Enegy Sta Data Cente Stoage Pogam Venon Mille IBM Nick Pincipe Dell EMC v6 Agenda Backgound on SNIA Emeald/Enegy Sta fo block Intoduce NAS/File test addition;

More information

Configuring RSVP-ATM QoS Interworking

Configuring RSVP-ATM QoS Interworking Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

IBM Optim Query Tuning Offerings Optimize Performance and Cut Costs

IBM Optim Query Tuning Offerings Optimize Performance and Cut Costs IBM Optim Quey Tuning Offeings Optimize Pefomance and Cut Costs Saghi Amisoleymani Solution Achitect Integated Data Management amisole@us.ibm.com June 9, 2010 Disclaime Copyight IBM Copoation [cuent yea].

More information

Communication vs Distributed Computation: an alternative trade-off curve

Communication vs Distributed Computation: an alternative trade-off curve Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,

More information

A New Free-form Deformation Through the Control of Parametric Surfaces

A New Free-form Deformation Through the Control of Parametric Surfaces A New Fee-fom Defomation Though the Contol of Paametic Sufaces Jieqing Feng Lizhuang Ma and Qunsheng Peng State Key Lab. of CAD&CG, Zhejiang Univesity Hangzhou 310027, P. R. of CHINA email: jqfeng@cad.zju.edu.cn

More information

4.2. Co-terminal and Related Angles. Investigate

4.2. Co-terminal and Related Angles. Investigate .2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as

More information

DYNAMIC STORAGE ALLOCATION. Hanan Samet

DYNAMIC STORAGE ALLOCATION. Hanan Samet ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

Siggraph Precomputed Radiance Transfer: Theory and Practice

Siggraph Precomputed Radiance Transfer: Theory and Practice Siggah 2005 Pecomuted Radiance Tansfe: Theoy and Pactice Summay Geneal model of shading and shadowing fo eal-time endeing. Basic adiance tansfe techniques, moe advanced techniques that incooate highe-fequency

More information

CISC 662 Graduate Computer Architecture Lecture 6 - Hazards

CISC 662 Graduate Computer Architecture Lecture 6 - Hazards CISC 662 Gaduate Compute Achitectue Lectue 6 - Hazads Michela Taufe http://www.cis.udel.edu/~taufe/teaching/cis662f07 Powepoint Lectue Notes fom John Hennessy and David Patteson s: Compute Achitectue,

More information

Getting Started PMW-EX1/PMW-EX3. 1 Rotate the grip with the RELEASE button pressed. Overview. Connecting the Computer and PMW-EX1/EX3

Getting Started PMW-EX1/PMW-EX3. 1 Rotate the grip with the RELEASE button pressed. Overview. Connecting the Computer and PMW-EX1/EX3 A PMW-EX1/PMW-EX3 Getting Stated Oveview This document descibes how to use the XDCAM EX Vesion Up Tool (heeafte Vesion Up Tool ) to upgade the PMW-EX1 and PMW-EX3 to vesion 1.20 (PMW-EX1) o vesion 1.10

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining EE 341 Lectue # 12 Instucto: Zeshan hishti zeshan@ece.pdx.edu Novembe 10, 2014 Potland State Univesity asic Pocessing Unit ontol Signals Hadwied ontol Datapath contol signals Dealing with memoy delay Pipelining

More information

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Meta Objects for Access Control: A Formal Model for Role-Based Principals

Meta Objects for Access Control: A Formal Model for Role-Based Principals Meta Objects f Access Contol: A Fmal Model f Role-Based Pincials Thomas Riechmann, Fanz J. Hauck Univesity of Elangen-Nünbeg* Deatment of Comute Science IV Matensst. 1, D-91058 Elangen, Gemany {iechmann,hauck}@infmatik.uni-elangen.de

More information

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

More information

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,

More information

Introduction To Pipelining. Chapter Pipelining1 1

Introduction To Pipelining. Chapter Pipelining1 1 Intoduction To Pipelining Chapte 6.1 - Pipelining1 1 Mooe s Law Mooe s Law says that the numbe of pocessos on a chip doubles about evey 18 months. Given the data on the following two slides, is this tue?

More information

HISTOGRAMS are an important statistic reflecting the

HISTOGRAMS are an important statistic reflecting the JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe

More information

Performance Optimization in Structured Wireless Sensor Networks

Performance Optimization in Structured Wireless Sensor Networks 5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame

More information

An Improved Resource Reservation Protocol

An Improved Resource Reservation Protocol Jounal of Compute Science 3 (8: 658-665, 2007 SSN 549-3636 2007 Science Publications An mpoved Resouce Resevation Potocol Desie Oulai, Steven Chambeland and Samuel Piee Depatment of Compute Engineeing

More information

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE CS 45: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 6 DR. MICHAEL J. REALE RASTERIZING CURVES OTHER THAN LINES When dealing with othe inds of cuves, we can daw it in one of the following was: Use elicit

More information

Automation Testing Frameworks for SharePoint application

Automation Testing Frameworks for SharePoint application Intenational Jounal of Compute Sciences and Engineeing Open Access Reseach Pape Volume-3, Issue-11 E-ISSN: 2347-2693 Automation Testing Famewoks fo ShaePoint application Madhu Dande 1 *, Neelima Galla

More information

Interesting Target Detection and Matching Algorithm Based on Phase Information

Interesting Target Detection and Matching Algorithm Based on Phase Information 009 Intenational Confeence on Machine Leaning and Comuting IPCSIT vol.3 0 0 IACSIT Pess Singaoe Inteesting Taget Detection and Matching Algoithm Based on Phase Infomation hitao Xiao Jun u Lei Geng Jianming

More information

CS 61C: Great Ideas in Computer Architecture. Pipelining Hazards. Instructor: Senior Lecturer SOE Dan Garcia

CS 61C: Great Ideas in Computer Architecture. Pipelining Hazards. Instructor: Senior Lecturer SOE Dan Garcia CS 61C: Geat Ideas in Compute Achitectue Pipelining Hazads Instucto: Senio Lectue SOE Dan Gacia 1 Geat Idea #4: Paallelism So9wae Paallel Requests Assigned to compute e.g. seach Gacia Paallel Theads Assigned

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes CS630 Repesenting and Accessing Digital Infomation Infomation Retieval: Basics Thosten Joachims Conell Univesity Infomation Retieval Basics Retieval Models Indexing and Pepocessing Data Stuctues ~ 4 lectues

More information

Persistent Memory what developers need to know Mark Carlson Co-chair SNIA Technical Council Toshiba

Persistent Memory what developers need to know Mark Carlson Co-chair SNIA Technical Council Toshiba Pesistent Memoy what developes need to know Mak Calson Co-chai SNIA Technical Council Toshiba 2018 Stoage Develope Confeence EMEA. All Rights Reseved. 1 Contents Welcome Pesistent Memoy Oveview Non-Volatile

More information

dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc

dc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc - CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish

More information

Pipes, connections, channels and multiplexors

Pipes, connections, channels and multiplexors Pipes, connections, channels and multiplexos Fancisco J. Ballesteos ABSTRACT Channels in the style of CSP ae a poeful abstaction. The ae close to pipes and connections used to inteconnect system and netok

More information

Conversion Functions for Symmetric Key Ciphers

Conversion Functions for Symmetric Key Ciphers Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401

More information

CS 2461: Computer Architecture 1 Program performance and High Performance Processors

CS 2461: Computer Architecture 1 Program performance and High Performance Processors Couse Objectives: Whee ae we. CS 2461: Pogam pefomance and High Pefomance Pocessos Instucto: Pof. Bhagi Naahai Bits&bytes: Logic devices HW building blocks Pocesso: ISA, datapath Using building blocks

More information

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the

More information

Lecture # 04. Image Enhancement in Spatial Domain

Lecture # 04. Image Enhancement in Spatial Domain Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency

More information

On using circuit-switched networks for file transfers

On using circuit-switched networks for file transfers On using cicuit-switched netwoks fo file tansfes Xiuduan Fang, Malathi Veeaaghavan Univesity of Viginia Email: {xf4c, mv5g}@viginia.edu Abstact High-speed optical cicuit-switched netwoks ae being deployed

More information

Administrivia. CMSC 411 Computer Systems Architecture Lecture 5. Data Hazard Even with Forwarding Figure A.9, Page A-20

Administrivia. CMSC 411 Computer Systems Architecture Lecture 5. Data Hazard Even with Forwarding Figure A.9, Page A-20 Administivia CMSC 411 Compute Systems Achitectue Lectue 5 Basic Pipelining (cont.) Alan Sussman als@cs.umd.edu as@csu dedu Homewok poblems fo Unit 1 due today Homewok poblems fo Unit 3 posted soon CMSC

More information

A New Finite Word-length Optimization Method Design for LDPC Decoder

A New Finite Word-length Optimization Method Design for LDPC Decoder A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology

More information

AN ANALYTICAL PERFORMANCE EVALUATION OF LNS/SMP MOBILITY MANAGEMENT SCHEME

AN ANALYTICAL PERFORMANCE EVALUATION OF LNS/SMP MOBILITY MANAGEMENT SCHEME Moea, Galli, McAuley, An Analytical Pefoance Evaluation Of LNS/SMP Mobility Manageent Schee, Milco 04 AN ANALYTICAL PERFORMANCE EVALUATION OF LNS/SMP MOBILITY MANAGEMENT SCHEME Raquel Moea, Stefano Galli,

More information

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension 17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach

More information

Collision Detection with Swept Spheres and Ellipsoids

Collision Detection with Swept Spheres and Ellipsoids Collision etection with Swet Shees and Ellisoids Joit Rouwé joit@games.lostbos.com Souce code: htt://www.thee4.demon.nl/swetellisoid/swetellisoid.zi. Intoduction Toda most games use conex olgons fo collision

More information

2. PROPELLER GEOMETRY

2. PROPELLER GEOMETRY a) Fames of Refeence 2. PROPELLER GEOMETRY 10 th Intenational Towing Tank Committee (ITTC) initiated the pepaation of a dictionay and nomenclatue of ship hydodynamic tems and this wok was completed in

More information

Performance Evaluation of TCP Vegas over Optical Burst Switched Networks

Performance Evaluation of TCP Vegas over Optical Burst Switched Networks Pefomae Evaluation of TCP Vegas ove Otical Bust Switched Netwoks Basem Shihada 1, Qiong Zhang 3, Pin-Han Ho 1,, 1 School of Comute Sciee, Univesity of ateloo, ateloo, Canada Deatment of Electical and Comute

More information

Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing

Dynamic Multiple Parity (DMP) Disk Array for Serial Transaction Processing IEEE TRANSACTIONS ON COMPUTERS, VOL. 50, NO. 9, SEPTEMBER 200 949 Dynamic Multiple Paity (DMP) Disk Aay fo Seial Tansaction Pocessing K.H. Yeung, Membe, IEEE, and T.S. Yum, Senio Membe, IEEE AbstactÐThe

More information

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions. In ode to lean which questions have been answeed coectly: 1. Pint these pages. 2. Answe the questions. 3. Send this assessment with the answes via: a. FAX to (212) 967-3498. O b. Mail the answes to the

More information

Accelerating Storage with RDMA Max Gurtovoy Mellanox Technologies

Accelerating Storage with RDMA Max Gurtovoy Mellanox Technologies Acceleating Stoage with RDMA Max Gutovoy Mellanox Technologies 2018 Stoage Develope Confeence EMEA. Mellanox Technologies. All Rights Reseved. 1 What is RDMA? Remote Diect Memoy Access - povides the ability

More information

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

Topological Characteristic of Wireless Network

Topological Characteristic of Wireless Network Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences

More information

The Internet Ecosystem and Evolution

The Internet Ecosystem and Evolution The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee

More information

5 4 THE BERNOULLI EQUATION

5 4 THE BERNOULLI EQUATION 185 CHATER 5 the suounding ai). The fictional wok tem w fiction is often expessed as e loss to epesent the loss (convesion) of mechanical into themal. Fo the idealied case of fictionless motion, the last

More information

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,

More information

DYNAMIC STORAGE ALLOCATION. Hanan Samet

DYNAMIC STORAGE ALLOCATION. Hanan Samet ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu

More information

The Processor: Improving Performance Data Hazards

The Processor: Improving Performance Data Hazards The Pocesso: Impoving Pefomance Data Hazads Monday 12 Octobe 15 Many slides adapted fom: and Design, Patteson & Hennessy 5th Edition, 2014, MK and fom Pof. May Jane Iwin, PSU Summay Pevious Class Pipeline

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

t [ Background removed

t [ Background removed HANDS-ON > HOE1 Taining 1 Pictues You decide to ceate a memoies slide show fo you siste and he husband, who wee ecently maied. You include thei high school Sweetheat Ball image, engagement and wedding

More information

BLUEPRINTS. Getting Ready. The Activity. Overview. Introducing

BLUEPRINTS. Getting Ready. The Activity. Overview. Introducing BLUEPRINTS GEOMETRY LOGIC Satial visualization Tansfomational eomety Gettin Reay What You ll Nee Cuisenaie Ros, 1 set e ai 1-centimete i ae, ae 99 Tansaent tae an/o lue sticks 3" x 5" cas onto which 1-centimete

More information

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS

SCALABLE ENERGY EFFICIENT AD-HOC ON DEMAND DISTANCE VECTOR (SEE-AODV) ROUTING PROTOCOL IN WIRELESS MESH NETWORKS SCALABL NRGY FFICINT AD-HOC ON DMAND DISTANC VCTOR (S-AODV) ROUTING PROTOCOL IN WIRLSS MSH NTWORKS Sikande Singh Reseach Schola, Depatment of Compute Science & ngineeing, Punjab ngineeing College (PC),

More information

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM

INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM INFORMATION DISSEMINATION DELAY IN VEHICLE-TO-VEHICLE COMMUNICATION NETWORKS IN A TRAFFIC STREAM LiLi Du Depatment of Civil, Achitectual, and Envionmental Engineeing Illinois Institute of Technology 3300

More information

An Unsupervised Segmentation Framework For Texture Image Queries

An Unsupervised Segmentation Framework For Texture Image Queries An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class

More information

Also available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010)

Also available at  ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) Also available at http://amc.imfm.si ISSN 1855-3966 (pinted edn.), ISSN 1855-3974 (electonic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 109 120 Fulleene patches I Jack E. Gave Syacuse Univesity, Depatment

More information

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver

RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Driver 1 RT-WLAN: A Soft Real-Time Extension to the ORiNOCO Linux Device Dive Amit Jain Daji Qiao Kang G. Shin The Univesity of Michigan Ann Abo, MI 4819, USA {amitj,dqiao,kgshin@eecs.umich.edu Abstact The cuent

More information

Prof. Feng Liu. Fall /17/2016

Prof. Feng Liu. Fall /17/2016 Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA

i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA i-pcgrid Wokshop 2016 Apil 1 st 2016 San Fancisco, CA Liang Min* Eddy Banks, Bian Kelley, Met Kokali, Yining Qin, Steve Smith, Philip Top, and Caol Woodwad *min2@llnl.gov, 925-422-1187 LDRD 13-ERD-043

More information

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks

Spiral Recognition Methodology and Its Application for Recognition of Chinese Bank Checks Spial Recognition Methodology and Its Application fo Recognition of Chinese Bank Checks Hanshen Tang 1, Emmanuel Augustin 2, Ching Y. Suen 1, Olivie Baet 2, Mohamed Cheiet 3 1 Cente fo Patten Recognition

More information

Scaling Location-based Services with Dynamically Composed Location Index

Scaling Location-based Services with Dynamically Composed Location Index Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute

More information