DB2 Buffer Pool Tuning - Top Down or Bottom Up? Joel Goldstein Responsive Systems 281 Highway 79 Morganville, NJ 07751

Size: px
Start display at page:

Download "DB2 Buffer Pool Tuning - Top Down or Bottom Up? Joel Goldstein Responsive Systems 281 Highway 79 Morganville, NJ 07751"

Transcription

1 DB2 Buffer Pool Tuning - Top Down or Bottom Up? Joel Goldstein Responsive Systems 281 Highway 79 Morganville, NJ Abstract: This paper addresses the goals and objectives of buffer pool tuning, and the performance data that should wave a "red flag" indicating performance problems. Available data from standard reporting facilities provides much information about performance, but does not provide the entire picture. The top down tuning approach uses DB2 data sources. The bottom up approach uses other data sources outside DB2 to provide information useful for buffer pool tuning. While most installations still seem to be under configured regarding the amount of memory allocated to buffer pools, others go the other way and throw memory at the pools. The goal/objective of buffer pool tuning is to eliminate I/Os, to reduce both transaction and batch elapsed times, and to optimize the DB2/Memory requirements necessary to obtain good performance. Pool Thresholds Let s not spend time on the critical thresholds that hopefully are known to everyone and address the others that are also very important, and those that sometimes have dual meanings. IWTH has two meanings: the first is very critical; however, many systems show hits of this threshold and it may not be critical at all. If SPTH and DMTH have not been hit, then this is nothing to be concerned about since it is probably due to the immediate write taking place either because of a second checkpoint or because a page was taken off a write queue to be used by another application and then written immediately. DWQT hits should be quite low, while VWQT hits are what you want to see - so in most cases, lowering the VWQT (often to Zero) is the best approach especially when the number of pages/write is in the single digit range. VWQT = 0 sets the write threshold to 32 pages at the object/dataset level. The total system read I/O rate/second should be calculated and tracked, since reducing this rate by as little as 10/second over a 20 hour day will save more than $100K of PU costs per year, as well as improving application performance. Page-ins per second should be summed for all the pools and if this approaches 100/sec indicates a lack of processor storage and excessive MVS paging. alculating a correct system hit ratio for each buffer pool is important for performance analysis, and tracking performance over time; however, the I/O rate per second is usually even more indicative of overall performance. The system hit ratio is calculated as: (Getpages - Pages Read) / Getpages where the pages read is the sum of all pages read by both prefetch functions and synchronous I/O. The Getpage/RIO ratio, often shown as an efficiency ratio by online monitors is not generally meaningful for tracking overall system performance and is only useful for application performance when almost all the access is random. What is a good number for a GP/RIO ratio? 5:1, 10:1, 50:1?? Obviously, the higher the better, but the numbers are not meaningful. When using HiperPools the HP retrieval ratio should be calculated and evaluated. How much benefit are you really getting from the HPs, how many I/Os per/second is the HP saving? Low percentages should be carefully evaluated. While a percentage below 10% certainly does not sound good, it may still provide significant benefit. When the percentage is low, consider the number of pages read from the HP in a synchronous manner. How many is this per second? The average number of pages read per second can still be enough to justify having the HP. Naturally, it is all a mater of perspective for your installation. If the rate is two or three per second, the HP is most likely a waste; however, even value as low as ten per second provide reasonable benefit and avoid the synchronous I/O to DASD, and avoid the application delays associated with physical I/Os. Backing the sort/work pool with a HP often provides no benefit; however, there have been several installations that did obtain significant performance benefits from this approach. So, as usual, it depends... We also want to track several different types of hit ratios when HiperPools are in use. This gives us the ability to measure the efficiency of each pool resource. Even considering that the movement of a page from a HP to a VP is only 35 Mcs, it is still more efficient (faster & less cost) to find the page in the VP. A field that is often mis-understood is urrent Active Buffers. It is important to understand that current active buffers does not mean the number of pages used or containing data. This is the number of buffers that are not available or locked. All buffers in a pool always contain data.

2 The buffer pool size information is available in the Ms indicates DASD performance problems. The statistics record, and an IFID 202 record containing the information in the buffer pool area of the accounting Dynamic Zparm information is produced at every statistics reports allow you to calculate a system hit ratio for ever interval. Incidentally, it is better to produce statistics execution of a plan or transaction. Between the wait records at 15 minute intervals than the default 30 minutes. times, and this information, it can be quite easy to home in This provides a better level of granularity than 30 minutes on problems before they become critical, or easy to without impacting performance, and also puts the data determine the base cause of performance problems. into the same measurement (elapsed) time frame as normal RMF data at most installations. BuffPool Buffer Pool ----> Get Page urr_active 51 Updates Read Hit % 7.89 Lst Pref VPOOL Alloc 9000 Seq Pref Exp/on 0 Dyn Pref HPOOL Alloc 0 PgsRdAsy # Backed Strg 0 SyncRead Exp/on 0 Read Fail 0 Write Fail 0 H/V Exp Fail 0 GetPage Total 1.061M Seq Random SyncRead Seq Random SeqPrefRead Request PagesRead Dis NoBf 0 Dis NoEn 0 WKFAbort 0 LstPrefRead 286 Request 249 PagesRead 3739 DynPrefRead 607 Request 626 PagesRead DWHorThreshold 1 DWVerThreshold 19 Take special note of the Synch Reads Seq field. First, there will almost always be some counts in here because prefetch always issues 1 synch I/O when it starts to run. However, large counts here, especially when coupled with low or negative hit ratios indicate a serious performance problem. Pages read into the pool for prefetch can be released (or thrown out) by other prefetch activity before an application can get to them for processing. When this happens, they are read back in using synchronous I/Os...and increment this counter. This has a serious performance impact on the elapsed time for the requesting, and most other, applications. This is most likely to happen in three (but not only) situations: when the processor is too busy (> 95%), when the application MVS dispatching priority is too low, or when the processor is not very busy and several large scan jobs execute concurrently. Application delays for I/O should be calculated from the Accounting Trace 101 records. What percentage of the application class 2 time is I/O wait? What is the average Synch I/O time? Below 18 Ms is good, 20 Ms is OK, > 20 Write HplWrite Fail Hpl Read Fail PgsRd Buffer Pool tuning usually produces substantial application performance improvements, even when the pools are not large. Pool size alone usually provides some improvement; however, the largest pay back comes from a combination of object placement and pool sizing. Pool & Object Analysis Now let s step beyond basic tracking of hit ratios and I/O rates, and determine what data is necessary to properly distribute the objects across multiple pools, and how we approach pool sizing. Just throwing memory at the environment may eventually provide the desired application response times. However, this usually wastes large amounts of memory, and memory is NOT an inexpensive resource... even though the cost is a mere fraction of what it was a few years ago. A meaningful period is the time period you consider important such as your Am or PM peak. A meaningful

3 elapsed time is a period long enough to be representative of your transaction or business functional mix. A few minutes is not usually long enough to provide a good representation of what truly happens in your system and buffer pools. This must also be for the entire system. Access data for a specific plan or user is interesting, but does not provide any insights about how it relates to the rest of the system and pool activity. ollecting performance trace data, we get the IFID 198, and 6-7. Since we are primarily concerned with READ performance, as it effects application response time, we need these three IFIDs. If we are also concerned with write activity, we also want the 8, 9, and 10 records. These are useful because they can show other I/O contentions, and the number of pages/write - that is necessary information for the proper setting of the VWQT. [Ref Statistics example 1] Based on the 198 records we obtain these statistics, that show an 82.0 % overall pool ratio hit ratio. However, this is the application hit ratio because it doesn t consider the number of pages read by prefetch functions. While the application hit ratio is a measure of application I/O delay, the system hit ratio is usually more important, because we are tuning a Global Resource - a system buffer pool. However, overall, the primary indicator is the I/O rate per second. Note the difference between the application hit ratio and the system hit ration on the report example report. When we utilize the 6 & 7 read records, we obtain the true system hit ratio. While the application hit ratio is important because it indicates application performance, this is across all application plans and can hide application performance problems caused by synchronous (or asynchronous) I/O wait times. These statistics can easily be produced by writing some code...using SAS, PL/1, Assembler, or even in REXX. When the average number of pages/write falls into the single digit range, the VWQT should normally be lowered to keep a trickle write going and avoid huge burst of write activity at checkpoint time, or when the DWQT is triggered for pools with hundreds of objects. [Ref Statistics Example 2] After the overall pool statistics, we want the same type of information for each object within a pool. The objects should be sorted in order of decreasing Getpage activity, because we want to see the most heavily accessed objects first. The Buffer Pool displays can produce similar information, but can t order it. Therefore, the most heavily accessed objects might be at the bottom of thousands of lines, or might be truncated off the report. Likewise, it will not work to try groups of display commands. At the detail level, they are incremental since the last display...and you need all information from the same time span and duration for the results to be meaningful. Online monitors can collect the data, but cannot save and process enough of it for the type of meaningful statistical analysis and other processing we have in mind. Snapshot collections of a few minutes are not generally useful unless the transaction workload and mix is very consistent...over a short period. Longer periods provide much better consistency and accuracy. Typically, we need several million getpage records (198s) for a system. What do we look for in the statistical analysis: Indexes with a high % of sequential access, or Sequentially Accessed Mostly (SAMO). The indexes and tablespaces that are Randomly Accessed Mostly (RAMO). Additionally, we break these into small and large working sets. This then gives classifications of RAMOS, RAMOL, SAMOS, SAMOL. The end result of the analysis is to group similarly accessed objects together. The RAMOL/RAMOS and SAMOL/SAMOS objects. Additionally, we must know specifically how they are accessed, and the average and maximum number of pages (working set) they had resident in a pool at any point during the collection period. Pool tuning, sizing, and object placement is not a guessing game. It takes a substantial effort to get everything done properly, and once done, it must be monitored frequently and adjustments made. New applications come into the system, SQL is re-coded and access paths change, databases grow, etc. Monitoring should be done at least on a monthly basis, and bi-weekly is better on highly active systems. Pool tuning, sizing, and effective object placement provides significant performance improvements...for the applications, for the DB2 system, for the DASD subsystem, and for the entire MVS complex. If DB2 was really easy, and static, you would not be sitting here today because the corporations wouldn t need any of us. Performance Prediction Now we get to the difficult part...attempting to simulate, or predict pool and object performance as sizes are changed and objects are moved around. [Ref. Simulation Example 1] Simulations are extremely difficult to write, and require a lot of formula tweaking to get correct results. However, it s the only way to ever get things done correctly (optimally) since you can t play dangerous and time consuming games with your production environment. Here we see simulation results indicating increasing pool hit ratios as the size is increased. Even more importantly, we can see the reduction/saving in the I/O rate. This has

4 the greatest impact on both application response times, Hit ratios for BP % BP % and can provide substantial PU/dollar cost savings. BP2 90%+ From these figures, 58,000 buffers is probably optimal System Read I/O per/second 165+ unless you have memory to spare and wish to pick up that IS Transactions Avg.53 Secs of 2 Elapsed extra 2 I/O per second. The average I/O Wait per Transaction.39 The simulation combines both simulation techniques and statistical analysis to provide useful information at the object level. The results from a simulation run must be analyzed in conjunction with a Statistical analysis that shows rates and type access for each object. A sequentially scanned object monopolizes a pool, and does not provide any significant improvement as the pool Effective pool placement using only 7000 more buffers reduced the I/O rate by more than 70/Sec., and reduced the lass 2 elapsed time by more than 1/4 second (actually.28 secs.). size is increased. Unless all the pages can fit into the ASE STUDY 2 pool, the scanning and I/O just keeps wrapping around. The analyst at this installation was using an online monitor Note the reduction of the I/O rate, and increase in hit ratio to look at the buffer pools - and they only show severe or as the pool size is increased. ompare the increases in situation critical events. The pool could actually be the Wkset for a small/medium TS that is mostly random thrashing, and the online monitors won t show any to the preceding TS that was continually scanned. The problems unless the analyst really knows what to look difference between the Avg and Max WkSet for the for...like the System Hit Ratio... or knowing when the I/O previous tablespace, and the Max ranges of more than rate/second is high. 80% of the total pool size. These two objects must be lient statements: separated into different pools. We Don t Have any Performance Problems We are Using Multiple Pools Already (11 Pools) Now let s look at a large object when the access is very Our Pool Performance is Good random. Here again, there is little benefit from increasing Total Memory Used for Pools: pool size because it is just too big and too random. This 126 Megabytes for Virtual Pools is death by synchronous I/O. 250 Megabytes for HiperPools [Ref. Simulation Example 3] Avg. Transaction Elapsed Time.192 Secs. (475K Trans) ASE STUDY 1 People sometimes say that their DB2 system doesn t have After Tuning the Pools any performance problems. Well, I have never seen one that didn t, and I firmly believe that every system has performance problems. Of course the critical factor is the magnitude of the problems, and the effort required to correct them. Sometimes (but rarely) the problems are not significant, while the effort will be very large...therefore they might not be worth fixing. When somebody says they don t have any DB2 performance problems, they often don t know whereto look, how to look for them, or simply haven t taken the time to look. Any installation using only one pool, and thinking they have good and efficient performance, really hasn t gotten the message. Why do you think IBM gave us 60 Pools, and there will be 80 in DB2 V6?? It s also very rare to find a system using only three or four pools with good performance. These are initial performance results from one installation...before tuning...that said they had good performance. Just because nobody complains, does not mean things are running well... Using 7 Buffer Pools 80 Megabytes for Virtual Pools 160 Megabytes for HiperPools Average Transaction Elapsed Time.157 Secs 18% Improvement Saved 46 Megabytes of VP & 90 Megabytes of HP A 136 Megabyte Saving Reduced the I/O Rate to 193/Sec. from 222/Sec. Saved 29 I/O Sec. Three Pools...65,000 Buffers Online Monitor indicates performance is good No critical thresholds are being hit Hit ratios usually in the mid 90% range Reality... Seconds Perhaps there is room for improvement...???

5 ASE STUDY 3 - PeopleSoft omplex application packages are very difficult to tune; however, there are still pay backs to be realized... Often the pool/object analysis process will identify application problems. Sometimes you are lucky and some of them can be corrected without major code changes. Especially when dealing with packaged software, actual code changes might not be possible. However; adding, deleting, or altering existing indexes may prove a valuable approach for obtaining performance improvements. Finding an object that receives heavy scan activity, and implementing an index can provide dramatic improvements. This was recently highlighted by an installation that recovered almost 20% of the entire 982 processor by adding one index to a table. While not a PeopleSoft application or other packaged software, this was another example where no problem was obvious to any user and nobody was screaming for help. Increased number of Pools from 3 to 6 Increased Memory requirements from 32 Meg up to 80 Meg Reduced I/O rate by almost 20/Sec Identified heavily Scanned Objects Added necessary Indexes Dropped un-necessary Indexes Recovered about 18% of the R53 processor PU Allowed the Application Rollout to complete All of the real PU saving from Application changes Buffer Pool Usage Suggestions Most installations should be able to optimize performance with 5 to 8 pools. While some installations might ultimately use a few more pools, too many simply means a lot more administrative work. In most cases might be an upper limit on effective pool and object tuning. Remember that the pools are a system resource. While segregating them on an application basis might be nice for the application, it is unlikely this approach will provide the most efficient usage of pool and memory resources. However, sometimes political expediency is appropriate. Using too many pools often wastes memory, and creates an administrative problem trying to track and analyze performance. Most installations do not have enough memory given to buffer pools to obtain good performance. While throwing memory at the system may be an easy thing to do, proper object placement will provide the best overall performance without wasting resources. Once the objects are properly grouped, the maintenance is easy and minimal. EXAMPLE POOL REOMMENDATIONS (1) BP0 atalog & Directory BP1 Random Indexes (S/M) BP2 Random Indexes (Lg/Huge) BP3 Scanned Tablespaces BP4 Random Tablespaces (S/M) BP5 Random Tablespaces (Lg..) BP7 DSNDB07 EXAMPLE POOL REOMMENDATIONS (2) BP0 atalog, Directory BP1 Random Indexes (S/M) BP2 Scanned Indexes (?) BP3 Random Indexes (Lg) BP4 Scanned Tablespaces (S/M) BP5 Scanned Tablespaces (Lg) BP6 Random Tablespaces (S/M) BP7 DSNDB07 BP8 Random Tablespaces (Lg) BP9 Random Tablespaces (Transient) Bottom UP Tuning While the performance of DASD systems has improved significantly over the decades, it remains a performance roadblock for large transaction based systems. The new software and hardware technologies offer great potential; however, the basics of performance have not changed within the last three decades and won t change within the next one. It is vital to monitor and tune the DASD environment. Dataset placement DOES matter (using an 80/20 approach). Always be careful of the averaging effect of long performance periods, since they will hide a large number of problems. Performance must be tracked at both the device and dataset level - looking at an average for the entire DASD environment will rarely show any problems. The elapsed time to retrieve a required page varies considerably depending on where it is coming from. As a general perspective of performance, consider the following average elapsed times: <.020 Seconds 3390 <.005 Seconds ache, Solid State Device Seconds HiperPool (100+ Times Faster than ache) The elapsed times for the 3390 are quite generous and more closely approximate an upper acceptable limit rather than the optimal expected time of 16 Ms.

6 Most installations still have poor overall DASD performance that impacts the online applications. Some of the primary causes are lack of staff time to properly place objects to reduce contention, and the ever larger capacity devices...so there are fewer physical devices to spread the objects and I/O workload across. While System Managed Storage (SMS) has many proponents from the DASD management side, it is a double edged sword. While it certainly reduces staff time for managing datasets, it has yet to show that it can provide acceptable performance when the entire environment is just given to SMS. Like many areas in our industry, somewhat of an 80/20 rule should be used. The important datasets should not be managed directly by SMS, nor can the placing of physical partitions of objects, nor can the DSNDB07 sort/work objects. Using separate storage classes to direct important objects to specific devices, or a specific group of devices can work quite well. One way to approach the data is to apply the calculated hit percentage to the number of I/Os. This should indicate the approximate number of I/Os that can be saved by tuning the object on the DB2 buffer pool side. The I/O elimination from pool tuning provides a positive cascading effect. Aside from the obvious elapsed time reductions and PU cost saving, the reduced I/O workload both decreases the stress on the DASD subsystem, and probably improves the cache usage and hit ratios for the remaining objects in the entire subsystem. One of the things that tends to mask poor DASD performance is system wide reporting, and very long reporting intervals. When the intervals are shortened to the peak load periods, and evaluated at the device and dataset levels, the problems really begin to stand out. Of course, as indicated earlier, tracking the average I/O wait times for transactions, average times for synchronous I/O, and overall I/O wait times for batch jobs always seem to show problem quite quickly also. The SMF 42-6 records provide a great source of performance information, and can be used to determine which objects will benefit from Buffer Pool Tuning. Those getting a high hit rate in the ache should be tuned at the system Buffer Pool level - I/Os are expensive, both from a PU and application delay perspective. Finding a page in DASD cache provides an I/O response of 4-5 Ms. Finding the same page in a BP is couple of Mcs without the added PU cost of the I/O. [Ref. Figure 1 & Figure 2] Some programming to process this data can make it easy to find problems quickly, such as multiple partitions on the same device, or multiple DSNDB07 sort/work files on the same device. Identifying the heavy hitters, the objects with the greatest opportunity is not too difficult. An important consideration is the evaluation and understanding of the data, and then determining which objects should be tuned in the buffer pools to avoid having to perform an I/O. The 42-6 record provides a field called cache hit %. However, this percentage applies only to data that was considered to be a cache candidate. It may be far more beneficial to calculate your own percentage based on the number of cache hits and the total I/Os. This is sometimes quite a bit lower than the supplied cache hit percentage.

7 Figure 1 Figure 2

8 Summary After physical design and SQL tuning, buffer pools are the greatest tuning opportunity for your system and applications. Last year at the 1997 International DB2 User Group (IDUG) conference, Intria/IB from Toronto illustrated their projected PU/cost saving at $1.3 Million Dollars over three years from I/O elimination, as well as reducing average transaction elapsed times by 20% for one system and 13% for a second system (presented at IDUG by Patrick Morrison & Richard Gaunt). The most important consideration for Buffer Pool tuning is the ability to predict the effect of changes - to avoid creating new or worse performance problems, or suffer an application outage while objects are stopped/restarted to move them into different pools. Pool tuning is not mysticism or a guessing game, nor is DASD tuning. Tools exist to help you do it the right way and achieve a substantial payback.

9 Statistics Example 1 Statistics for Buffer Pool: BP0 Buffer size is...4k Number of VP Buffers is...10,000 VP sequential threshold is...80% Number of HP Buffers is...0 HP sequential threshold is...80% Hiper Space astout is...y Verticle Write Threshold...10% Horizontal Write Threshold...50% Number of GetP...2,379,499 Number of Sequential Access..1,429, % of GetP Number of Random Access...709, % of GetP Number of RID_List...240, % of GetP Number of Random Misses...277, Misses per Sec Number of Misses (others)...149, Misses per Sec Number of No_Reads % of GetP Number of Hits...1,952, % of GetP (Appl. HIT RATIO) System HIT RATIO % Avg. Page Residency Seconds Number of Pages Read...1,553, Pages per Second Number of Sync Pages Read...393, % of Pages Read Number of SPref Pages Read...999, % of Pages Read Number of LPref Pages Read...14, % of Pages Read Number of DPref Pages Read...144, % of Pages Read Number of Read I/Os...442, I/Os per Second Number of Sync Read I/Os...393, % of Read I/Os Number of SPref Read I/Os...32, % of Read I/Os Number of LPref Read I/Os...11, % of Read I/Os Number of DPref Read I/Os...4, % of Read I/Os Delay of Sync Read I/Os...23 Avg. MSeconds (Max 249) Delay of SPref Read I/Os...36 Avg. MSeconds (Max 250) Delay of Lpref Read I/Os...43 Avg. MSeconds (Max 249) Delay of DPref Read I/Os...44 Avg. MSeconds (Max 243) Number of SetW (Updates)...170,158 Number of Pages Written...73, Pages per Sec Number of Sync Pages Written % of Pages Written Number of ASync Pages Written...73, % of Pages Written Number of Write I/Os...45, I/Os per Sec Number of Sync Write I/Os % of Write I/Os Number of ASync Write I/Os...45, % of Write I/Os Delay of Sync Write I/Os...7 Avg. MSeconds (Max 66) Delay of ASync Write I/Os...4 Avg. MSeconds (Max 231) Average Number Pages/Write...1.6

10 Statistics Example 2 Statistics for Table Space...DB2PO.SOLNSORD Number of GetP...690, % of pool GetP Number of Sequential Access.634, % of GetP Number of Random Access...56, % of GetP Number of RID_List % of GetP <<< Note Number of Random Misses...27, Misses per Sec Number of Misses (others)...19, Misses per Sec Number of No_Reads % of GetP Number of Hits...643, % of GetP (Appl. HIT RATIO) System HIT RATIO % Avg. Page Residency...0 Seconds Number of Pages Read...704, Pages per Second Number of Sync Pages Read...27, % of Pages Read Number of SPref Pages Read...654, % of Pages Read Number of LPref Pages Read % of Pages Read Number of DPref Pages Read...22, % of Pages Read Number of Read I/Os...49, Read I/Os per Sec Number of Sync Read I/Os...27, % of Read I/Os Number of SPref Read I/Os...20, % of Read I/Os Number of LPref Read I/Os % of Read I/Os Number of DPref Read I/Os % of Read I/Os Delay of Sync Read I/Os...21 Avg. MSeconds (Max 239) Delay of SPref Read I/Os...38 Avg. MSeconds (Max 250) Delay of LPref Read I/Os...0 Avg. MSeconds (Max 0) Delay of DPref Read I/Os...43 Avg. MSeconds (Max 183) Number of SetW (Updates)...14, % of pool SetW Number of Pages Written...8, Pages per Sec Number of Sync Pages Written % of Pages Written Number of ASync Pages Written...8, % of Pages Written Number of Write I/Os...4, I/Os per Sec Number of Sync Write I/Os % of Write I/Os Number of ASync Write I/Os...4, % of Write I/Os Delay of Sync Write I/Os...6 Avg. MSeconds (Max 6) Delay of ASync Write I/Os...4 Avg. MSeconds (Max 219) Average Pages/Write (Asynch): 1.67

11 Simulation Example 1 Results of Simulation for Buffer Pool...BP0 Bpool GetP total...2,379,499 Bpool Size GetP used Num. of Hits ApHit Ratio 10,000 2,362,768 1,971, % 18,000 2,349,204 2,049, % 26,000 2,322,343 2,067, % 34,000 2,294,862 2,070, % 42,000 2,267,584 2,064, % 50,000 2,233,613 2,044, % 58,000 2,171,257 1,995, % 66,000 2,160,792 1,991, % Bpool Size Pages Read Read I/O SyHit Ratio 10, /S /S 34.0 % << Baseline Verification 18, /S 95.0 /S 42.6 % 26, /S 83.1 /S 46.7 % 34, /S 75.1 /S 49.9 % 42, /S 69.2 /S 51.6 % 50, /S 66.3 /S 52.5 % 58, /S 64.2 /S 52.6 % 66, /S 62.1 /S 53.6 % Simulation Example 2 Results for Tablespace...DB2PO.HOLDSORD Object GetP total...406,973 ( 17.1% of BP GetP) Bpool Size GetP used Num. of Hits ApHit Ratio Avg. WSet Max. WSet 10, , , % 2,352 6,653 18, , , % 3,512 7,072 26, , , % 4,312 8,501 34, , , % 4,914 8,476 42, , , % 5,341 8,643 50, , , % 5,592 8,712 Bpool Size Pages Read Read I/O SyHit Ratio 10, /S 31.0 /S 25.4 % 18, /S 17.2 /S 55.4 % 26, /S 12.5 /S 66.0 % 34, /S 9.3 /S 74.2 % 42, /S 7.1 /S 78.9 % 50, /S 6.5 /S 81.3 %

12 Simulation Example 3 Results for Index Space...DB2PO.SOLNSOI1 Object GetP total...559,377 ( 17.2% of BP GetP) Bpool Size GetP used Num. of Hits ApHit Ratio Avg. WSet Max. WSet 10, , , % 3,364 6,264 18, , , % 7,249 10,112 26, , , % 9,656 12,314 34, , , % 13,513 15,965 42, , , % 15,223 17,101 50, , , % 16,174 18,096 Bpool Size Pages Read Read I/O SyHit Ratio 10, /S 20.8 /S 58.1 % 18, /S 19.9 /S 58.5 % 26, /S 19.5 /S 59.1 % 34, /S 18.9 /S 59.7 % 42, /S 18.7 /S 60.1 % 50, /S 18.4 /S 60.5 %

DB2 is a complex system, with a major impact upon your processing environment. There are substantial performance and instrumentation changes in

DB2 is a complex system, with a major impact upon your processing environment. There are substantial performance and instrumentation changes in DB2 is a complex system, with a major impact upon your processing environment. There are substantial performance and instrumentation changes in versions 8 and 9. that must be used to measure, evaluate,

More information

An A-Z of System Performance for DB2 for z/os

An A-Z of System Performance for DB2 for z/os Phil Grainger, Lead Product Manager BMC Software March, 2016 An A-Z of System Performance for DB2 for z/os The Challenge Simplistically, DB2 will be doing one (and only one) of the following at any one

More information

ANALYZING DB2 DATA SHARING PERFORMANCE PROBLEMS

ANALYZING DB2 DATA SHARING PERFORMANCE PROBLEMS ANALYZING ATA SHARING PERFORMANCE PROLEMS onald R. eese Computer Management Sciences, Inc. 6076- Franconia Road Alexandria, VA 310 data sharing offers many advantages in the right environment, and performs

More information

Rdb features for high performance application

Rdb features for high performance application Rdb features for high performance application Philippe Vigier Oracle New England Development Center Copyright 2001, 2003 Oracle Corporation Oracle Rdb Buffer Management 1 Use Global Buffers Use Fast Commit

More information

Optimising Insert Performance. John Campbell Distinguished Engineer IBM DB2 for z/os Development

Optimising Insert Performance. John Campbell Distinguished Engineer IBM DB2 for z/os Development DB2 for z/os Optimising Insert Performance John Campbell Distinguished Engineer IBM DB2 for z/os Development Objectives Understand typical performance bottlenecks How to design and optimise for high performance

More information

Buffer Pool Tuning for the new Large Memory World Parts 1 & 2

Buffer Pool Tuning for the new Large Memory World Parts 1 & 2 Session: B05 & B06 Buffer Pool Tuning for the new Large Memory World Parts 1 & 2 Joel Goldstein Responsive Systems May 8, 2007 9:20 a.m. 11:40 a.m. Platform: z/os Abstract: The basics and effective techniques

More information

Presentation Abstract

Presentation Abstract Presentation Abstract From the beginning of DB2, application performance has always been a key concern. There will always be more developers than DBAs, and even as hardware cost go down, people costs have

More information

Improving VSAM Application Performance with IAM

Improving VSAM Application Performance with IAM Improving VSAM Application Performance with IAM Richard Morse Innovation Data Processing August 16, 2004 Session 8422 This session presents at the technical concept level, how IAM improves the performance

More information

DB2 Data Sharing Then and Now

DB2 Data Sharing Then and Now DB2 Data Sharing Then and Now Robert Catterall Consulting DB2 Specialist IBM US East September 2010 Agenda A quick overview of DB2 data sharing Motivation for deployment then and now DB2 data sharing /

More information

The Attraction of Complexity

The Attraction of Complexity The Attraction of Complexity Carlo Bottiglieri December 10, 2017 1 Introduction How is complexity distributed through a codebase? Does this distribution present similarities across different projects?

More information

MAINVIEW Batch Optimizer. Data Accelerator Andy Andrews

MAINVIEW Batch Optimizer. Data Accelerator Andy Andrews MAINVIEW Batch Optimizer Data Accelerator Andy Andrews Can I push more workload through my existing hardware configuration? Batch window problems can often be reduced down to two basic problems:! Increasing

More information

OPS-23: OpenEdge Performance Basics

OPS-23: OpenEdge Performance Basics OPS-23: OpenEdge Performance Basics White Star Software adam@wss.com Agenda Goals of performance tuning Operating system setup OpenEdge setup Setting OpenEdge parameters Tuning APWs OpenEdge utilities

More information

Paging algorithms. CS 241 February 10, Copyright : University of Illinois CS 241 Staff 1

Paging algorithms. CS 241 February 10, Copyright : University of Illinois CS 241 Staff 1 Paging algorithms CS 241 February 10, 2012 Copyright : University of Illinois CS 241 Staff 1 Announcements MP2 due Tuesday Fabulous Prizes Wednesday! 2 Paging On heavily-loaded systems, memory can fill

More information

CSE 153 Design of Operating Systems

CSE 153 Design of Operating Systems CSE 153 Design of Operating Systems Winter 18 Lecture 18/19: Page Replacement Memory Management Memory management systems Physical and virtual addressing; address translation Techniques: Partitioning,

More information

Segregating Data Within Databases for Performance Prepared by Bill Hulsizer

Segregating Data Within Databases for Performance Prepared by Bill Hulsizer Segregating Data Within Databases for Performance Prepared by Bill Hulsizer When designing databases, segregating data within tables is usually important and sometimes very important. The higher the volume

More information

DB2 9 for z/os: Buffer Pool Monitoring and Tuning

DB2 9 for z/os: Buffer Pool Monitoring and Tuning Draft Document for Review October 9, 2009 11:29 am 4604paper.fm Redpaper DB2 9 for z/os: Buffer Pool Monitoring and Tuning Mike Bracey Introduction DB2 buffer pools are a key resource for ensuring good

More information

All Paging Schemes Depend on Locality. VM Page Replacement. Paging. Demand Paging

All Paging Schemes Depend on Locality. VM Page Replacement. Paging. Demand Paging 3/14/2001 1 All Paging Schemes Depend on Locality VM Page Replacement Emin Gun Sirer Processes tend to reference pages in localized patterns Temporal locality» locations referenced recently likely to be

More information

LeakDAS Version 4 The Complete Guide

LeakDAS Version 4 The Complete Guide LeakDAS Version 4 The Complete Guide SECTION 4 LEAKDAS MOBILE Second Edition - 2014 Copyright InspectionLogic 2 Table of Contents CONNECTING LEAKDAS MOBILE TO AN ANALYZER VIA BLUETOOTH... 3 Bluetooth Devices...

More information

Craig S. Mullins. A DB2 for z/os Performance Roadmap By Craig S. Mullins. Database Performance Management Return to Home Page.

Craig S. Mullins. A DB2 for z/os Performance Roadmap By Craig S. Mullins. Database Performance Management Return to Home Page. Craig S. Mullins Database Performance Management Return to Home Page December 2002 A DB2 for z/os Performance Roadmap By Craig S. Mullins Assuring optimal performance is one of a database administrator's

More information

Divisibility Rules and Their Explanations

Divisibility Rules and Their Explanations Divisibility Rules and Their Explanations Increase Your Number Sense These divisibility rules apply to determining the divisibility of a positive integer (1, 2, 3, ) by another positive integer or 0 (although

More information

Best Practices. Deploying Optim Performance Manager in large scale environments. IBM Optim Performance Manager Extended Edition V4.1.0.

Best Practices. Deploying Optim Performance Manager in large scale environments. IBM Optim Performance Manager Extended Edition V4.1.0. IBM Optim Performance Manager Extended Edition V4.1.0.1 Best Practices Deploying Optim Performance Manager in large scale environments Ute Baumbach (bmb@de.ibm.com) Optim Performance Manager Development

More information

CS162 Operating Systems and Systems Programming Lecture 11 Page Allocation and Replacement"

CS162 Operating Systems and Systems Programming Lecture 11 Page Allocation and Replacement CS162 Operating Systems and Systems Programming Lecture 11 Page Allocation and Replacement" October 3, 2012 Ion Stoica http://inst.eecs.berkeley.edu/~cs162 Lecture 9 Followup: Inverted Page Table" With

More information

DB2 and Memory Exploitation. Fabio Massimo Ottaviani - EPV Technologies. It s important to be aware that DB2 memory exploitation can provide:

DB2 and Memory Exploitation. Fabio Massimo Ottaviani - EPV Technologies. It s important to be aware that DB2 memory exploitation can provide: White Paper DB2 and Memory Exploitation Fabio Massimo Ottaviani - EPV Technologies 1 Introduction For many years, z/os and DB2 system programmers have been fighting for memory: the former to defend the

More information

IMS Backup & Recovery Insurance Are you covered?

IMS Backup & Recovery Insurance Are you covered? IMS Backup & Recovery Insurance Are you covered? Rosemary Galvan & Nick Griffin BMC Software Thursday, March 15,2012 Session Number : 10816 Agenda Backup and Recovery Solution for IMS from BMC Software

More information

Chapter 8 Virtual Memory

Chapter 8 Virtual Memory Operating Systems: Internals and Design Principles Chapter 8 Virtual Memory Seventh Edition William Stallings Operating Systems: Internals and Design Principles You re gonna need a bigger boat. Steven

More information

Historical Collection Best Practices. Version 2.0

Historical Collection Best Practices. Version 2.0 Historical Collection Best Practices Version 2.0 Ben Stern, Best Practices and Client Success Architect for Virtualization and Cloud bstern@us.ibm.com Copyright International Business Machines Corporation

More information

DB2 Performance Essentials

DB2 Performance Essentials DB2 Performance Essentials Philip K. Gunning Certified Advanced DB2 Expert Consultant, Lecturer, Author DISCLAIMER This material references numerous hardware and software products by their trade names.

More information

The Major CPU Exceptions in EPV Part 2

The Major CPU Exceptions in EPV Part 2 The Major CPU Exceptions in EPV Part 2 Mark Cohen Austrowiek EPV Technologies April 2014 6 System capture ratio The system capture ratio is an inverted measure of the internal system overhead. So the higher

More information

DB2 for z/os Buffer Pool Tuning: "Win by divide and conquer or lose by multiply and surrender"

DB2 for z/os Buffer Pool Tuning: Win by divide and conquer or lose by multiply and surrender DB2 for z/os Buffer Pool Tuning: "Win by divide and conquer or lose by multiply and surrender" par Michael Dewert IBM, DB2 for z/os Development Réunion du Guide DB2 pour z/os France Mercredi 25 novembre

More information

Lesson 2: Using the Performance Console

Lesson 2: Using the Performance Console Lesson 2 Lesson 2: Using the Performance Console Using the Performance Console 19-13 Windows XP Professional provides two tools for monitoring resource usage: the System Monitor snap-in and the Performance

More information

To REORG or not to REORG That is the Question. Kevin Baker BMC Software

To REORG or not to REORG That is the Question. Kevin Baker BMC Software To REORG or not to REORG That is the Question Kevin Baker BMC Software Objectives Identify I/O performance trends for DB pagesets Correlate reorganization benefits to I/O performance trends Understand

More information

Performance Impacts of Using Shared ICF CPs

Performance Impacts of Using Shared ICF CPs Performance Impacts of Using Shared ICF CPs Enhancements to the 9672 CMOS family included the introduction of Internal Coupling Facilities, (ICFs). ICFs are Processing Units (PUs) on a 9672, zseries, or

More information

Global and Application Levels Exception Detection System, Based on MASF Technique Igor Trubin, Ph.D. Capital One Services, Inc.

Global and Application Levels Exception Detection System, Based on MASF Technique Igor Trubin, Ph.D. Capital One Services, Inc. Global and Application Levels Exception Detection System, Based on MASF Technique Igor Trubin, Ph.D. Capital One Services, Inc. The paper describes one site's experience of using Multivariate Adaptive

More information

Legacy Transaction Integration TM In a Service-oriented Architecture (SOA)

Legacy Transaction Integration TM In a Service-oriented Architecture (SOA) November 2003 Legacy Transaction Integration TM In a Service-oriented Architecture (SOA) Introduction Over the next year or so, every serious IT analyst and software vendor will figuratively jump upon

More information

Virtualization. Q&A with an industry leader. Virtualization is rapidly becoming a fact of life for agency executives,

Virtualization. Q&A with an industry leader. Virtualization is rapidly becoming a fact of life for agency executives, Virtualization Q&A with an industry leader Virtualization is rapidly becoming a fact of life for agency executives, as the basis for data center consolidation and cloud computing and, increasingly, as

More information

Sysplex: Key Coupling Facility Measurements Cache Structures. Contact, Copyright, and Trademark Notices

Sysplex: Key Coupling Facility Measurements Cache Structures. Contact, Copyright, and Trademark Notices Sysplex: Key Coupling Facility Measurements Structures Peter Enrico Peter.Enrico@EPStrategies.com 813-435-2297 Enterprise Performance Strategies, Inc (z/os Performance Education and Managed Service Providers)

More information

IBM Tivoli OMEGAMON XE for Storage on z/os Version Tuning Guide SC

IBM Tivoli OMEGAMON XE for Storage on z/os Version Tuning Guide SC IBM Tivoli OMEGAMON XE for Storage on z/os Version 5.1.0 Tuning Guide SC27-4380-00 IBM Tivoli OMEGAMON XE for Storage on z/os Version 5.1.0 Tuning Guide SC27-4380-00 Note Before using this information

More information

!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced?

!! What is virtual memory and when is it useful? !! What is demand paging? !! When should pages in memory be replaced? Chapter 10: Virtual Memory Questions? CSCI [4 6] 730 Operating Systems Virtual Memory!! What is virtual memory and when is it useful?!! What is demand paging?!! When should pages in memory be replaced?!!

More information

z990 and z9-109 Performance and Capacity Planning Issues

z990 and z9-109 Performance and Capacity Planning Issues z990 and z9-109 Performance and Capacity Planning Issues Cheryl Watson Session 501; CMG2005 in Orlando December 8, 2005 Watson & Walker, Inc. home of Cheryl Watson's TUNING Letter, CPU Chart, BoxScore

More information

White paper ETERNUS Extreme Cache Performance and Use

White paper ETERNUS Extreme Cache Performance and Use White paper ETERNUS Extreme Cache Performance and Use The Extreme Cache feature provides the ETERNUS DX500 S3 and DX600 S3 Storage Arrays with an effective flash based performance accelerator for regions

More information

Advanced Database Systems

Advanced Database Systems Lecture IV Query Processing Kyumars Sheykh Esmaili Basic Steps in Query Processing 2 Query Optimization Many equivalent execution plans Choosing the best one Based on Heuristics, Cost Will be discussed

More information

Breakdown of Some Common Website Components and Their Costs.

Breakdown of Some Common Website Components and Their Costs. Breakdown of Some Common Website Components and Their Costs. Breakdown of Some Common Website Components and Their Costs. The cost of a website can vary dramatically based on the specific components included.

More information

AIX Power System Assessment

AIX Power System Assessment When conducting an AIX Power system assessment, we look at how CPU, Memory and Disk I/O are being consumed. This can assist in determining whether or not the system is sufficiently sized. An undersized

More information

SysGauge SYSTEM MONITOR. User Manual. Version 4.7. Apr Flexense Ltd.

SysGauge SYSTEM MONITOR. User Manual. Version 4.7. Apr Flexense Ltd. SysGauge SYSTEM MONITOR User Manual Version 4.7 Apr 2018 www.sysgauge.com info@flexense.com 1 1 SysGauge Product Overview...3 2 SysGauge Product Versions...6 3 Product Installation...7 4 System Monitor

More information

Anthony AWR report INTERPRETATION PART I

Anthony AWR report INTERPRETATION PART I Anthony AWR report INTERPRETATION PART I What is AWR? AWR stands for Automatically workload repository, Though there could be many types of database performance issues, but when whole database is slow,

More information

PAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo

PAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo PAGE REPLACEMENT Operating Systems 2015 Spring by Euiseong Seo Today s Topics What if the physical memory becomes full? Page replacement algorithms How to manage memory among competing processes? Advanced

More information

Decrease IT Cost. Using SQL Server 2012 to. eguide. By Michael K. Campbell

Decrease IT Cost. Using SQL Server 2012 to. eguide. By Michael K. Campbell eguide Using SQL Server 2012 to Decrease IT Cost By Michael K. Campbell SQL Server 2012 represents a major release, one that provides a number of new features, options, tools, capabilities, and benefits

More information

10 MONITORING AND OPTIMIZING

10 MONITORING AND OPTIMIZING MONITORING AND OPTIMIZING.1 Introduction Objectives.2 Windows XP Task Manager.2.1 Monitor Running Programs.2.2 Monitor Processes.2.3 Monitor System Performance.2.4 Monitor Networking.2.5 Monitor Users.3

More information

Running SNAP. The SNAP Team October 2012

Running SNAP. The SNAP Team October 2012 Running SNAP The SNAP Team October 2012 1 Introduction SNAP is a tool that is intended to serve as the read aligner in a gene sequencing pipeline. Its theory of operation is described in Faster and More

More information

IBM Education Assistance for z/os V2R2

IBM Education Assistance for z/os V2R2 IBM Education Assistance for z/os V2R2 Item: RSM Scalability Element/Component: Real Storage Manager Material current as of May 2015 IBM Presentation Template Full Version Agenda Trademarks Presentation

More information

z/os Db2 Batch Design for High Performance

z/os Db2 Batch Design for High Performance Division of Fresche Solutions z/os Db2 Batch Design for High Performance Introduction Neal Lozins SoftBase Product Manager All tests in this presentation were run on a dedicated zbc12 server We used our

More information

Database Management Systems. Buffer and File Management. Fall Queries. Query Optimization and Execution. Relational Operators

Database Management Systems. Buffer and File Management. Fall Queries. Query Optimization and Execution. Relational Operators Database Management Systems Buffer and File Management Fall 2017 Yea, from the table of my memory I ll wipe away all trivial fond records. -- Shakespeare, Hamlet The BIG Picture Queries Query Optimization

More information

Graph Structure Over Time

Graph Structure Over Time Graph Structure Over Time Observing how time alters the structure of the IEEE data set Priti Kumar Computer Science Rensselaer Polytechnic Institute Troy, NY Kumarp3@rpi.edu Abstract This paper examines

More information

THINGS YOU NEED TO KNOW ABOUT USER DOCUMENTATION DOCUMENTATION BEST PRACTICES

THINGS YOU NEED TO KNOW ABOUT USER DOCUMENTATION DOCUMENTATION BEST PRACTICES 5 THINGS YOU NEED TO KNOW ABOUT USER DOCUMENTATION DOCUMENTATION BEST PRACTICES THIS E-BOOK IS DIVIDED INTO 5 PARTS: 1. WHY YOU NEED TO KNOW YOUR READER 2. A USER MANUAL OR A USER GUIDE WHAT S THE DIFFERENCE?

More information

DATABASE SCALABILITY AND CLUSTERING

DATABASE SCALABILITY AND CLUSTERING WHITE PAPER DATABASE SCALABILITY AND CLUSTERING As application architectures become increasingly dependent on distributed communication and processing, it is extremely important to understand where the

More information

Process size is independent of the main memory present in the system.

Process size is independent of the main memory present in the system. Hardware control structure Two characteristics are key to paging and segmentation: 1. All memory references are logical addresses within a process which are dynamically converted into physical at run time.

More information

The Dark Arts of MQ SMF Evaluation

The Dark Arts of MQ SMF Evaluation The Dark Arts of MQ SMF Evaluation Lyn Elkins elkinsc@us.ibm.com Session # 13884 August 13, 2013 Code! 1 The witch trial MQ is broken! Agenda Review of SMF 115 and SMF 116 class 3 data Hunting down the

More information

Performance Monitoring

Performance Monitoring Performance Monitoring Performance Monitoring Goals Monitoring should check that the performanceinfluencing database parameters are correctly set and if they are not, it should point to where the problems

More information

Sysplex/CICSplex/DB2 Data Sharing: Assessing the Costs and Analyzing New Measurement Data Ellen Friedman, SRM Associates

Sysplex/CICSplex/DB2 Data Sharing: Assessing the Costs and Analyzing New Measurement Data Ellen Friedman, SRM Associates Sysplex/CICSplex/DB2 Data Sharing: Assessing the Costs and Analyzing New Measurement Data Ellen Friedman, SRM Associates Abstract The S/390 CMOS technology coupled with Parallel Sysplex/ CICSplex and DB2

More information

The Web Version of this chapter is split into 4 pages - this is page 1 - page contents are as follows:

The Web Version of this chapter is split into 4 pages - this is page 1 - page contents are as follows: 1 of 8 11/2/2001 1:45 PM MVS Systems Programming Home Chapter 3a - MVS Internals Contents The Web Version of this chapter is split into 4 pages - this is page 1 - page contents are as follows: Section

More information

Virtual Memory. ICS332 Operating Systems

Virtual Memory. ICS332 Operating Systems Virtual Memory ICS332 Operating Systems Virtual Memory Allow a process to execute while not completely in memory Part of the address space is kept on disk So far, we have assumed that the full address

More information

VIRTUAL MEMORY READING: CHAPTER 9

VIRTUAL MEMORY READING: CHAPTER 9 VIRTUAL MEMORY READING: CHAPTER 9 9 MEMORY HIERARCHY Core! Processor! Core! Caching! Main! Memory! (DRAM)!! Caching!! Secondary Storage (SSD)!!!! Secondary Storage (Disk)! L cache exclusive to a single

More information

Technical Documentation Version 7.4. Performance

Technical Documentation Version 7.4. Performance Technical Documentation Version 7.4 These documents are copyrighted by the Regents of the University of Colorado. No part of this document may be reproduced, stored in a retrieval system, or transmitted

More information

Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras

Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras (Refer Slide Time: 00:17) Lecture No - 10 Hill Climbing So, we were looking

More information

Transaction Delays and Quality Affecting Customer Service and Cost

Transaction Delays and Quality Affecting Customer Service and Cost Transaction Delays and Quality Affecting Customer Service and Cost Customer Service Can Be Frustrating Dealing with upset and angry customers is stressful, until it is not The Quality of Lane Transactions

More information

A Talari Networks White Paper. Turbo Charging WAN Optimization with WAN Virtualization. A Talari White Paper

A Talari Networks White Paper. Turbo Charging WAN Optimization with WAN Virtualization. A Talari White Paper A Talari Networks White Paper Turbo Charging WAN Optimization with WAN Virtualization A Talari White Paper Turbo Charging WAN Optimization with WAN Virtualization 2 Introduction WAN Virtualization is revolutionizing

More information

Digital Workflow 10 Tech Rules to Guide You

Digital Workflow 10 Tech Rules to Guide You Last updated: 10/11/10 Digital Workflow 10 Tech Rules to Guide You Introduction Whether your goal is to become paperless, or just to get more out of the technology you use, you need to (1) find the easy

More information

The Need for Speed: Understanding design factors that make multicore parallel simulations efficient

The Need for Speed: Understanding design factors that make multicore parallel simulations efficient The Need for Speed: Understanding design factors that make multicore parallel simulations efficient Shobana Sudhakar Design & Verification Technology Mentor Graphics Wilsonville, OR shobana_sudhakar@mentor.com

More information

Final Examination CS 111, Fall 2016 UCLA. Name:

Final Examination CS 111, Fall 2016 UCLA. Name: Final Examination CS 111, Fall 2016 UCLA Name: This is an open book, open note test. You may use electronic devices to take the test, but may not access the network during the test. You have three hours

More information

What it does not show is how to write the program to retrieve this data.

What it does not show is how to write the program to retrieve this data. Session: A16 IFI DATA: IFI you don t know, ask! Jeff Gross CA, Inc. 16 October 2008 11:45 12:45 Platform: DB2 for z/os Abstract The Instrumentation Facility Interface (IFI) can be a daunting resource in

More information

Up and Running Software The Development Process

Up and Running Software The Development Process Up and Running Software The Development Process Success Determination, Adaptative Processes, and a Baseline Approach About This Document: Thank you for requesting more information about Up and Running

More information

Westfield DB2 z/os System Management

Westfield DB2 z/os System Management Westfield DB2 z/os System Management Managing the Pain with Stats, Charts, Graphs, & REXX NEODBUG Aug 16, 2012 Mike Smith Westfield Insurance Agenda About Westfield DB2 Workload and Environment Tools and

More information

(THE) ULTIMATE CONTACT STRATEGY HOW TO USE PHONE AND FOR CONTACT AND CONVERSION SUCCESS SALES OPTIMIZATION STUDY

(THE) ULTIMATE CONTACT STRATEGY HOW TO USE PHONE AND  FOR CONTACT AND CONVERSION SUCCESS SALES OPTIMIZATION STUDY (THE) ULTIMATE CONTACT STRATEGY HOW TO USE PHONE AND EMAIL FOR CONTACT AND CONVERSION SUCCESS EXECUTIVE SUMMARY This study, derived from the data of nearly 3.5 million leads, breaks new ground, revealing

More information

Using TLC to Check Inductive Invariance

Using TLC to Check Inductive Invariance Using TLC to Check Inductive Invariance Leslie Lamport 23 August 2018 1 Inductive Invariance Suppose we have a specification with initial predicate Init and next-state predicate Next, so its specification

More information

ECE 669 Parallel Computer Architecture

ECE 669 Parallel Computer Architecture ECE 669 Parallel Computer Architecture Lecture 9 Workload Evaluation Outline Evaluation of applications is important Simulation of sample data sets provides important information Working sets indicate

More information

z/os Heuristic Conversion of CF Operations from Synchronous to Asynchronous Execution (for z/os 1.2 and higher) V2

z/os Heuristic Conversion of CF Operations from Synchronous to Asynchronous Execution (for z/os 1.2 and higher) V2 z/os Heuristic Conversion of CF Operations from Synchronous to Asynchronous Execution (for z/os 1.2 and higher) V2 z/os 1.2 introduced a new heuristic for determining whether it is more efficient in terms

More information

Continuous Processing versus Oracle RAC: An Analyst s Review

Continuous Processing versus Oracle RAC: An Analyst s Review Continuous Processing versus Oracle RAC: An Analyst s Review EXECUTIVE SUMMARY By Dan Kusnetzky, Distinguished Analyst Most organizations have become so totally reliant on information technology solutions

More information

Financial Statements Using Crystal Reports

Financial Statements Using Crystal Reports Sessions 6-7 & 6-8 Friday, October 13, 2017 8:30 am 1:00 pm Room 616B Sessions 6-7 & 6-8 Financial Statements Using Crystal Reports Presented By: David Hardy Progressive Reports Original Author(s): David

More information

Lesson 4 Transcript: DB2 Architecture

Lesson 4 Transcript: DB2 Architecture Lesson 4 Transcript: DB2 Architecture Slide 1: Cover Welcome to Lesson 4 of the DB2 on campus series. Today we are going to talk about the DB2 architecture. My name is Raul Chong and I am the DB2 on Campus

More information

The Total Network Volume chart shows the total traffic volume for the group of elements in the report.

The Total Network Volume chart shows the total traffic volume for the group of elements in the report. Tjänst: Network Health Total Network Volume and Total Call Volume Charts Public The Total Network Volume chart shows the total traffic volume for the group of elements in the report. Chart Description

More information

B.H.GARDI COLLEGE OF ENGINEERING & TECHNOLOGY (MCA Dept.) Parallel Database Database Management System - 2

B.H.GARDI COLLEGE OF ENGINEERING & TECHNOLOGY (MCA Dept.) Parallel Database Database Management System - 2 Introduction :- Today single CPU based architecture is not capable enough for the modern database that are required to handle more demanding and complex requirements of the users, for example, high performance,

More information

6.001 Notes: Section 17.5

6.001 Notes: Section 17.5 6.001 Notes: Section 17.5 Slide 17.5.1 Now, let's look at one example in which changing the evaluation model allows us to explore a very different kind of computational problem. Our goal is to show how

More information

Virtual Memory. Chapter 8

Virtual Memory. Chapter 8 Virtual Memory 1 Chapter 8 Characteristics of Paging and Segmentation Memory references are dynamically translated into physical addresses at run time E.g., process may be swapped in and out of main memory

More information

Running SNAP. The SNAP Team February 2012

Running SNAP. The SNAP Team February 2012 Running SNAP The SNAP Team February 2012 1 Introduction SNAP is a tool that is intended to serve as the read aligner in a gene sequencing pipeline. Its theory of operation is described in Faster and More

More information

Performance Key Metrics: March 29, 2011 Version Bill Bitner

Performance Key Metrics: March 29, 2011 Version Bill Bitner Performance Key Metrics: March 29, 2011 Version Bill Bitner bitnerb@us.ibm.com While there are 1000s of VM Performance Metrics, the following are some of the most important ones to consider. I ve included

More information

Multi-threading technology and the challenges of meeting performance and power consumption demands for mobile applications

Multi-threading technology and the challenges of meeting performance and power consumption demands for mobile applications Multi-threading technology and the challenges of meeting performance and power consumption demands for mobile applications September 2013 Navigating between ever-higher performance targets and strict limits

More information

Reminder: Mechanics of address translation. Paged virtual memory. Reminder: Page Table Entries (PTEs) Demand paging. Page faults

Reminder: Mechanics of address translation. Paged virtual memory. Reminder: Page Table Entries (PTEs) Demand paging. Page faults CSE 451: Operating Systems Autumn 2012 Module 12 Virtual Memory, Page Faults, Demand Paging, and Page Replacement Reminder: Mechanics of address translation virtual address virtual # offset table frame

More information

(Refer Slide Time: 01.26)

(Refer Slide Time: 01.26) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture # 22 Why Sorting? Today we are going to be looking at sorting.

More information

Configuring Short RPO with Actifio StreamSnap and Dedup-Async Replication

Configuring Short RPO with Actifio StreamSnap and Dedup-Async Replication CDS and Sky Tech Brief Configuring Short RPO with Actifio StreamSnap and Dedup-Async Replication Actifio recommends using Dedup-Async Replication (DAR) for RPO of 4 hours or more and using StreamSnap for

More information

The Impact Of DB2 Version 4 On Recovery

The Impact Of DB2 Version 4 On Recovery The Impact Of DB2 Version 4 On Recovery By Willie Favero DB2 is once again the talk of the town with the arrival of Version 4. So it is time to take a look at how the latest release of IBM's Relational

More information

Distributed Virtual Reality Computation

Distributed Virtual Reality Computation Jeff Russell 4/15/05 Distributed Virtual Reality Computation Introduction Virtual Reality is generally understood today to mean the combination of digitally generated graphics, sound, and input. The goal

More information

Lotus Sametime 3.x for iseries. Performance and Scaling

Lotus Sametime 3.x for iseries. Performance and Scaling Lotus Sametime 3.x for iseries Performance and Scaling Contents Introduction... 1 Sametime Workloads... 2 Instant messaging and awareness.. 3 emeeting (Data only)... 4 emeeting (Data plus A/V)... 8 Sametime

More information

MySQL Performance Optimization and Troubleshooting with PMM. Peter Zaitsev, CEO, Percona

MySQL Performance Optimization and Troubleshooting with PMM. Peter Zaitsev, CEO, Percona MySQL Performance Optimization and Troubleshooting with PMM Peter Zaitsev, CEO, Percona In the Presentation Practical approach to deal with some of the common MySQL Issues 2 Assumptions You re looking

More information

Evaluation Report: Improving SQL Server Database Performance with Dot Hill AssuredSAN 4824 Flash Upgrades

Evaluation Report: Improving SQL Server Database Performance with Dot Hill AssuredSAN 4824 Flash Upgrades Evaluation Report: Improving SQL Server Database Performance with Dot Hill AssuredSAN 4824 Flash Upgrades Evaluation report prepared under contract with Dot Hill August 2015 Executive Summary Solid state

More information

z990 Performance and Capacity Planning Issues

z990 Performance and Capacity Planning Issues z990 Performance and Capacity Planning Issues Cheryl Watson Session 2537; SHARE 104 in Anaheim March 2, 2005 Watson & Walker, Inc. home of Cheryl Watson's TUNING Letter, CPU Chart, BoxScore & GoalTender

More information

Computer Science 210 Data Structures Siena College Fall Topic Notes: Complexity and Asymptotic Analysis

Computer Science 210 Data Structures Siena College Fall Topic Notes: Complexity and Asymptotic Analysis Computer Science 210 Data Structures Siena College Fall 2017 Topic Notes: Complexity and Asymptotic Analysis Consider the abstract data type, the Vector or ArrayList. This structure affords us the opportunity

More information

E-Guide DATABASE DESIGN HAS EVERYTHING TO DO WITH PERFORMANCE

E-Guide DATABASE DESIGN HAS EVERYTHING TO DO WITH PERFORMANCE E-Guide DATABASE DESIGN HAS EVERYTHING TO DO WITH PERFORMANCE D atabase performance can be sensitive to the adjustments you make to design. In this e-guide, discover the affects database performance data

More information

The attendee will get a deep dive into all the DDL changes needed in order to exploit DB2 V10 Temporal tables as well as the limitations.

The attendee will get a deep dive into all the DDL changes needed in order to exploit DB2 V10 Temporal tables as well as the limitations. The attendee will get a deep dive into all the DDL changes needed in order to exploit DB2 V10 Temporal tables as well as the limitations. A case study scenario using a live DB2 V10 system will be used

More information

Page 1. Goals for Today" TLB organization" CS162 Operating Systems and Systems Programming Lecture 11. Page Allocation and Replacement"

Page 1. Goals for Today TLB organization CS162 Operating Systems and Systems Programming Lecture 11. Page Allocation and Replacement Goals for Today" CS162 Operating Systems and Systems Programming Lecture 11 Page Allocation and Replacement" Finish discussion on TLBs! Page Replacement Policies! FIFO, LRU! Clock Algorithm!! Working Set/Thrashing!

More information

Chapter 8. Operating System Support. Yonsei University

Chapter 8. Operating System Support. Yonsei University Chapter 8 Operating System Support Contents Operating System Overview Scheduling Memory Management Pentium II and PowerPC Memory Management 8-2 OS Objectives & Functions OS is a program that Manages the

More information