Buffer Cache Waits. In This Section 1.latch: cache buffers chains 2.latch: cache buffers lru chain 3.Free Buffer Wait 4.Buffer Busy Wait 5.Write Complete.

Slides:



Advertisements
Similar presentations
Office of the Accountant General (A&E) Andhra Pradesh Hyderabad
Advertisements

IO Waits Kyle Hailey #.2 Copyright 2006 Kyle Hailey Waits Covered in this Section  db file sequential read  db file scattered.
Enqueue Waits : Locks. #.2 Copyright 2006 Kyle Hailey Wait Tree - Locks Waits Disk I/O Library Cache Enqueue Undo TX 6 Row Lock TX 4 ITL Lock HW Lock.
Enqueue Waits : Locks. #.2 Copyright 2006 Kyle Hailey Locks REDO Lib Cache Buffer Cache IO Locks Network.
1/43 Tanel PoderEoug User2User day Freelists vs ASSM in Oracle9i Tanel Poder independent technology consultant 20-Oct-03 OracleWorld.
5 Copyright © 2005, Oracle. All rights reserved. Managing Database Storage Structures.
1 Chapter 16 Latch and Mutex Contention. 2 Architecture Overview of Latches Protect Oracle’s SGA Prevent two processes from updating same area of SGA.
Oracle Touch Count Algorithm
Buffer Cache Waits. #.2 Copyright 2006 Kyle Hailey Buffer Cache Waits Waits Disk I/O Buffer Busy Library Cache Enqueue SQL*Net Free Buffer Hot Blocks.
Acknowledgments Byron Bush, Scott S. Hilpert and Lee, JeongKyu
Oracle Architecture. Instances and Databases (1/2)
Page Footer Keed Education Oracle Database Administration Basic Copyright 2009 Keed Education BV Version Concept.
Basic Storage Concepts and Settings
1 - Oracle Server Architecture Overview
Harvard University Oracle Database Administration Session 2 System Level.
Oracle Architectural Components
Harvard University Oracle Database Administration Session 5 Data Storage.
Redo Waits Kyle Hailey #.2 Copyright 2006 Kyle Hailey Log File Waits  Redo is written to disk when  User commits  Log Buffer.
Redo Waits Kyle Hailey #.2 Copyright 2006 Kyle Hailey Redo REDO Lib Cache Buffer Cache Locks Network I/O.
1 Copyright © 2005, Oracle. All rights reserved. Introduction.
Waits Defined Kyle Hailey #.2 Copyright 2006 Kyle Hailey Top 36 Foreground Waits write complete waits library cache.
1 Copyright © 2009, Oracle. All rights reserved. Exploring the Oracle Database Architecture.
Oracle Database Administration Database files Logical database structures.
Database Administration TableSpace & Data File Management
Chapter Oracle Server An Oracle Server consists of an Oracle database (stored data, control and log files.) The Server will support SQL to define.
Basic Oracle Architecture
Review of Memory Management, Virtual Memory CS448.
1 Robert Wijnbelt Health Check your Database A Performance Tuning Methodology.
Part II : Waits Events Kyle Hailey
7202ICT Database Administration Lecture 7 Managing Database Storage Part 2 Orale Concept Manuel Chapter 3 & 4.
Extents, segments and blocks in detail. Database structure Database Table spaces Segment Extent Oracle block O/S block Data file logical physical.
Architecture Rajesh. Components of Database Engine.
Database Systems Slide 1 Database Systems Lecture 5 Overview of Oracle Database Architecture - Concept Manual : Chapters 1,8 Lecturer : Dr Bela Stantic.
7202ICT – Database Administration
Buffer Cache Waits. #.2 In This Section 1.latch: cache buffers chains 2.latch: cache buffers lru chain 3.latch: cache buffer handles 4.Free Buffer Wait.
Copyright © Oracle Corporation, All rights reserved. 1 Oracle Architectural Components.
An Oracle server:  Is a database management system that provides an open, comprehensive, integrated approach to information management.  Consists.
9 Storage Structure and Relationships. 9-2 Objectives Listing the different segment types and their uses Controlling the use of extents by segments Stating.
15 Copyright © 2006, Oracle. All rights reserved. Performance Tuning: Summary.
Database structure and space Management. Database Structure An ORACLE database has both a physical and logical structure. By separating physical and logical.
Outline Introduction to Oracle Memory Structures SGA, PGA, SCA The Specifics of the System Global Area (SGA) Structures Overview of Program Global Areas.
Database structure and space Management. Segments The level of logical database storage above an extent is called a segment. A segment is a set of extents.
1 Chapter 17 Shared Memory Contention. 2 Overview Specifically talking about SGA – Buffer Cache – Redo Log Buffer Contention in these areas of SGA – Can.
Week 3 Lecture 2 Basic Storage Concepts and Settings.
14 Copyright © 2006, Oracle. All rights reserved. Tuning Block Space Usage.
1 Some Real Problem  What if a program needs more memory than the machine has? —even if individual programs fit in memory, how can we run multiple programs?
Database Storage Structures
#.6 Sampling Kyle Hailey
1 Logical I/O Julian Dyke Independent Consultant Web Version juliandyke.com © 2005 Julian Dyke.
Lecture 10 Page 1 CS 111 Summer 2013 File Systems Control Structures A file is a named collection of information Primary roles of file system: – To store.
Chapter 5 Index and Clustering
Preface 1Performance Tuning Methodology: A Review Course Structure 1-2 Lesson Objective 1-3 Concepts 1-4 Determining the Worst Bottleneck 1-5 Understanding.
Oracle Architecture - Structure. Oracle Architecture - Structure The Oracle Server architecture 1. Structures are well-defined objects that store the.
7 Copyright © Oracle Corporation, All rights reserved. Instance and Media Recovery Structures.
SQL*Net & Other Waits. #.2 Copyright 2006 Kyle Hailey SQL*Net Waits Session Shadow Log Buffer Buffer Cache Log Buffer Buffer Cache SGA Library Cache Host.
IT Database Administration Section 05. Rollback Segments: An Introduction  What are they?  Space within a database used to store “before” images.
What is Oracle ? Oracle is a relational database management system. It is a management system which uses the relational data model. In the relational data.
8 Copyright © Oracle Corporation, All rights reserved. Managing Tablespaces and Data files.
Oracle Database Architectural Components
Chapter 21 SGA Architecture and Wait Event Summarized & Presented by Yeon JongHeum IDS Lab., Seoul National University.
Module 11: File Structure
Initialization Parameters
Database structure and space Management
Kyle Hailey Redo Waits Kyle Hailey
Storage Structure and Relationships
Lecture 10: Buffer Manager and File Organization
Kyle Hailey Enqueue Waits : Locks Kyle Hailey
Oracle Memory Internals
ISYS366, Oracle Disk Internals
Presentation transcript:

Buffer Cache Waits

In This Section 1.latch: cache buffers chains 2.latch: cache buffers lru chain 3.Free Buffer Wait 4.Buffer Busy Wait 5.Write Complete Wait 6.Buffer Exterminate

REDO Log Files Data Files DBWR LGWR User3 User2 User1 Log Buffer Buffer Cache Log Buffer Buffer Cache SGA Library Cache Oracle Memory Structures RAM : Machine Memory

Buffer Cache Access  Buffer Cache Management  Locating Free blocks  Finding data blocks  Managing LRU lists  Cleaning Dirty Blocks  Buffer Cache management can cause contention  Different from IO ( reading blocks of disk )

Is Block in cache? Now you have a file# and block# How do you know if a block is cached? ShadowProcess ? Do you search all the blocks? Could be 1000s of blocks to search. Buffer caches are in the multi Gig

Buffer Cache Find a block by: 1) Hash of Data file # Block# 2) Result = Bucket # 3) Search linked list for that bucket # What is a hash value What are Buckets What is the linked list?

Double Linked Lists 03C C C38F60 03C C38F60 03C39478 Address Next Previous

Hashing Function  Simple hash could be a Mod function  1 mod 4 = 1  2 mod 4 = 2  3 mod 4 = 3  4 mod 4 = 0  5 mod 4 = 1  6 mod 4 = 2  7 mod 4 = 3  8 mod 4 = 0  Using “mod 4” as a hash function creates 4 “buckets” to store things

Hash Bucket Fill Data Block Header Hash Block’s file# block #’s Result in a bucket# Put Block in bucket ? ? ? ? Hash Block’s 1 file# 437 block #’s (1+437) mod 4 = 2 After a while the buckets become populated with blocks

Latches Protect Bucket Contents Buffer Headers Data Blocks Hash bucket latches Buffer Headers contents described by X$BH

X$bh  Describes Contents of Buffer Headers SQL> desc x$bh Name Type ADDR RAW(4) DBARFIL NUMBER DBABLK NUMBER OBJ NUMBER HLADDR RAW(4) NXT_HASH RAW(4) PRV_HASH RAW(4) … much more ADDR DBARFIL DBABLK OBJ HLADDR NXT_HASH PRV_HASH … A each buffer header contains Information about the data block It points to and the previous and next Buffer header in a linked list

X$BH describes Headers Buffer Headers Data Blocks Hash bucket latches HLADDR NXT_HASH PRV_HASH ADDR DBARFIL DBABLK OBJ x$bh ADDR DBARFIL DBABLK OBJ HLADDR NXT_HASH PRV_HASH

To Find a Block 1.Hash the block address 2.Get Bucket latch 3.Look for header 4.Found, read block in cache 5.Not Found Read block off disk ShadowProcess Buffer Headers Data Blocks Hash bucket latches

Cache Buffers Chains Hash Buckets s5 s4 s3 s2 s1 Sessions Contention if too many accesses on a bucket latches Block Headers Data Blocks Cache Buffer Chain

Examples S1 S2 S3 S4 1.Look up Table 2.Nested Loops Select t1.val, t2.val from t1, t2 where t1.c1 = {value} and t2.id = t1.id; t1 Index_t2 t2

CBC Solutions Find SQL ( Why is application hitting the block so hard? )  Nested loops, possibly  Hash Partition  Uses Hash Join  Hash clusters  Look up tables (“ select language from lang_table where...”)  Change application  Use plsql function  Spread data out to reduce contention (pctfree=99)  Select from dual  Possibly use x$dual How do you find the SQL?

Which SQL select count(*), sql_id from v$active_session_history ash where event like 'latch: cache buffers chains' group by sql_id order by count(*) / CNT SQL_ID a09r4dwjpv01q

CBC: OEM

CBC: ADDM Problem SQL Statement Solution?

Finding the Hot Block: X$BH.TCH  Updated when block read  Updated by no more than 1 every 3 seconds  Can be used to find “hot” blocks  Note: set back to zero when block cycles through the buffer cache

CBC – Further Investigation select * from v$event_name where name = 'latch: cache buffers chains' EVENT# NAME latch: cache buffers chains PARAMETER1 PARAMETER2 PARAMETER address number tries NOTE: _db_block_hash_buckets = # of hash buckets _db_block_hash_latches= # of hash latches

CBC – Real Time select count(*), lpad(replace(to_char(p1,'XXXXXXXXX'),' ','0'),16,0) laddr from v$active_session_history where event= 'latch: cache buffers chains' group by p1; select o.name, bh.dbarfil, bh.dbablk, bh.tch from x$bh bh, obj$ o where tch > 100 and hladdr=' D ' and o.obj#=bh.obj order by tch COUNT(*) LADDR D NAME DBARFIL DBABLK TCH EMP_CLUSTER

Putting into one Query select name, file#, dbablk, obj, tch, hladdr from x$bh bh, obj$ o where o.obj#(+)=bh.obj and hladdr in ( select ltrim(to_char(p1,'XXXXXXXXXX') ) from v$active_session_history where event like 'latch: cache%' group by p1 having count(*) > 5 ) and tch > 5 order by tch NAME FILE# DBABLK OBJ TCH HLADDR BBW_INDEX BD91180 IDL_UB1$ BDB8A80 VIEW$ BD91180 VIEW$ BDB8A80 DUAL BDB8A80 DUAL BD91180 MGMT_EMD_PING BDB8A80 This can be misleading, as TCH gets set to 0 ever rap around the LRU and it only gets updated once every 3 seconds, so in this case DUAL was my problem table not MGMT_EMD_PING

Hot Block via Tanel Poder Sessions Loop 100,000 times Latch Holders Event names

Consistent Read Blocks Current Block (XCUR) s1 s2 Update Select Consistent Read (CR) Clone & Undo Both have same file# and block# and hash to same bucket

latches CBC: Consistent Read Blocks Cache Buffer Chain Contention: Too Many Buffers in Bucket s5 s4 s3 s2 s1 Hash Buckets Block Headers Max length : _db_block_max_cr_dba = 6 (in 10g)

Consistent Read Copies select count(*), name, file#, dbablk, hladdr from x$bh bh, obj$ o where o.obj#(+)=bh.obj and hladdr in ( select ltrim(to_char(p1,'XXXXXXXXXX') ) from v$active_session_history where event like 'latch: cache%' group by p1 ) group by name,file#, dbablk, hladdr having count(*) > 1 order by count(*); CNT NAME FILE# DBABLK HLADDR MYDUAL C9F4B20

CBC : Solution  Find the SQL causing the problem  Change Application Logic  Eliminate hot spots  Look up tables  Uses pl/sql functions  Minimize data per block (pctfree=99)  Possibly using x$dual instead of dual  Oracle added fast dual in 10g, as long as the field “dummy” isn’t accessed uses fast dual  Index Nested loops  Hash join  Hash partition index  Hash Cluster  Updates, inserts, select for update on blocks while reading those blocks  Cause multiple copies select ash.sql_id, count(*), sql_text from v$active_session_history ash, v$sqlstats sql where event='latch: cache buffers chains' and sql.sql_id(+)=ash.sql_id group by ash.sql_id, sql_text;

Block Pinning Buffer Headers Data Blocks Hash bucket latches

Free Buffer Wait Finding a Free Block  If the data block isn’t in cache  Get a free block and header in the buffer cache  Read it off disk  Update the free header  Read the block into the buffer cache Need Free Block to Read in New Data Block  Tune by  Increase data blocks  Try to tune DBWR

Finding a Free BlockShadowProcess When a session reads a block Into the bufffer cache how does it find a FREE spot?

Finding a Free Block Buffer Headers Data Blocks Hash bucket latches 1.Arrange the Buffer Headers into an LRU List 2.Scan LRU for a free block

Cache Buffers LRU = entry in x$bh

X$bh  Describes Buffer Headers SQL> desc x$bh Name Type ADDR RAW(4) DBARFIL NUMBER DBABLK NUMBER OBJ NUMBER HLADDR RAW(4) NXT_HASH RAW(4) PRV_HASH RAW(4) NXT_REPL RAW(4) PRV_REPL RAW(4) NXT_REPL RAW(4) PRV_REPL RAW(4) HLADDR RAW(4) NXT_HASH RAW(4) PRV_HASH RAW(4) Cache buffer chains LRU

LRU Chain 03C C38F60 03C C38F60 03C39478 ADDR NXT_HASH PRV_HASH 03C C C C C385F4 03C38554 NXT_REPL PRV_REPL

Cache Buffers LRU list

LRU Chain of Buffer Headers Buffer Cache

Cache Buffers LRU LatchMRU LRU Buffer Headers “Cold” LRU = Least Recently Used MRU = Most Recently Used One LRU Latch protects the linked list during changes to the list “Hot” LRU latch

Session Searching for Free BlocksMRU LRU Buffer Headers Session Shadow 1.Go to the LRU end of data blocks 2.Look for first non-dirty block 3.If search too many post DBWR to make free 4.Free Buffer wait

Free Buffer Wait Solutions  Tune by  Increase data blocks  Try to tune DBWR  ASYNC  If no ASYNC use I/O Slaves (dbwr_io_slaves)  Multiple DBWR (db_writer_processes)  Direct I/O  Tune Inefficient SQL  requesting large # of blocks

Session Finding a Free BlockMRU LRU Hot End Mid-Point Insertion Get LRU Latch Find Free Block Insert Header Release LRU Latch session LRU Latch Note: FTS read in at the cold end CR copies as well

DBWR taking Dirty Blocks offMRU LRU Buffer Headers LRU DBWR Dirty List of Buffer Headers LRUW latch LRU latch also covers DBWR list of dirty blocs

Cache Buffers LRU Latch MRU LRU Mid-Point Insertion Oracle Tracks the touch count of blocks. As the block is pushed to the LRU end, if it’s touch count is 3 or more, it’s promoted to the MRU end

Multiple Sets Solution: Multiple Sets _db_block_lru_latches = 8 10gR2 with cpu_count = 2 X$KCBWDS – set descriptor Set 1 Set 2 LRU Latch 1 LRU Latch 2

Test Case  8 Sessions  reading separate tables  Tables were too big to hold in cache  cache option set on each table  Result : lots of buffer cache churn  Expected to get “latch: cache buffer chains LRU”

simulator lru latch

CBC – Further Investigation select p2, count(*) from v$active_session_history where event= 'latch free' group by p2 select * from v$latchname where latch#=127 P2 COUNT(*) LATCH# NAME simulator lru latch select * from v$event_name where name = 'latch free' PARAMETER1 PARAMETER2 PARAMETER address number tries

db_cache_advice Alter system set db_cache_advice=off; Group “other” is very small compared to I/O wait time – not a problem

Cache Buffers LRU Latch : Solution Other  Increase Size of Buffer Cache  Using multiple cache buffers  Keep, recycle  Possibly increase _db_block_lru_latches  Not supported

write complete waits  Usually happens in tandem with free buffer  Tune by  Increase data block cache  Happens because shadow wants to access blocks that are currently being written to disk by DBWR  also seen it happen when there is a lot of write to sort the waits are on block 2 of the temp tablespace file

Write Complete Waits LRU DBWR Dirty List of Buffer Headers LRUW Session

Buffer Busy Waits  User 1 tries to change a buffer header  User 2 has buffer header “locked” (pinned) User1 User2

10g Buffer Busy Waits  Mainly, on 10g (There are a few other cases ) BLOCK CLASS=data block (and some segment header)  Object Type = INDEX  Object Type = TABLE Indicates DML contention  To verify use P3. P3 = Block Class (on iR2 was BBW type)

Other Class Types :  Segment header  When also seeing “data block” on the same object and the object is of OTYPE= “TABLE” then confirms that the TABLE needs to use free lists or ASSM.  File Header Block  Most likely extent allocation problems, look at extent size on tablespace and increase the extent size  Free lists  Add free list groups  Undo header  Not enough UNDO segments, if using old RBS then switch to AUM  “alter system set undo_management=auto scope=spfile;”  1st level bmb  Contention on ASSM bitmap blocks, might do better using freelists.  Undo block  Hot spot in UNDO, application issue

How to get Class Name select rownum n,ws.class from v$waitstat; NAME P1 P2 P buffer busy waits file# block# class# NAME P1 P2 P buffer busy waits file# block# class# select * from v$event_name where name = 'buffer busy waits' N CLASS data block 2 sort block 3 save undo block 4 segment header 5 save undo header 6 free list 7 extent map 8 1st level bmb 9 2nd level bmb 10 3rd level bmb 11 bitmap block 12 bitmap index block 13 file header block 14 unused 15 system undo header 16 system undo block 17 undo header 18 undo block Note: Before 10g, P3 was BBW type If P3 in 100,110,120,130 then read Now “read by other session” Else Write, P3 in 200,210,220,230, 231 P3 = class#, how do we get class name?

Joining ASH with v$waitstat select o.object_name obj, o.object_type otype, ash.SQL_ID, w.class from v$active_session_history ash, ( select rownum class#, class from v$waitstat ) w, all_objects o where event='buffer busy waits' and w.class#(+)=ash.p3 and o.object_id (+)= ash.CURRENT_OBJ# Order by sample_time; OBJ OTYPE SQL_ID CLASS TOTO1 TABLE 8gz51m9hg5yuf data block TOTO1 TABLE 8gz51m9hg5yuf segment header TOTO1 TABLE 8gz51m9hg5yuf data block

Example: Lack of Free List S1 S2 S3 S4 4 Sessions running Insert into toto1 values (null, ‘a’); Commit; OBJN OTYPE FILEN BLOCKN SQL_ID BLOCK_TYPE TOTO1 TABLE gz51m9hg5yuf data block TOTO1 TABLE gz51m9hg5yuf segment header

Example: BBW with Insert  Concurrent inserts will insert into the same block  Each session has to wait for the previous session to finish it’s write  Usually pretty fast  Contention builds on highly concurrent applications  Lack of Free Lists  Not Using ASSM (Automatic Segment Space Management)

Solution1: Free Lists S1 S2 S3 S4 4 Sessions running Insert into toto values (null, ‘a’); Commit;

Solution2: ASSM S1 S2 S3 S4 Header and Level 3 BMB Level 1 BMB Level 1 BMB Level 1 BMB Level 2 BMB Level 1 BMB

Tablespace Types : ASSM select tablespace_name, extent_management LOCAL, allocation_type EXTENTS, segment_space_management ASSM, initial_extent from dba_tablespaces TABLESPACE_NAME LOCAL EXTENTS ASSM SYSTEM LOCAL SYSTEM MANUAL UNDOTBS1 LOCAL SYSTEM MANUAL SYSAUX LOCAL SYSTEM AUTO TEMP LOCAL UNIFORM MANUAL USERS LOCAL SYSTEM AUTO EXAMPLE LOCAL SYSTEM AUTO DATA LOCAL SYSTEM MANUAL create tablespace data2 datafile '/d3/kyle/data2_01.dbf' size 200M segment space management auto;

BBW: ASSM  Consider using Freelists instead of ASSM  Normally waits on ASSM blocks should be too small to warrant using Freelists  ASSM is easier, automatically managed

BBW on Index Index Session 1 Session 2 Session 3 Increasing index key creates a hot spot on the leading index leaf OBJN OTYPE FILEN BLOCKN SQL_ID BLOCK_TYPE BBW_INDEX_INDEX dgthz60u28d data block 1  Use Reverse Key indexes  Breaks Index scans  Hash Partition Index  More IOs per index access

BBW on Index Solutions 1. Hash Partitions 2. Reverse Keys

BBW on Index : ADDM Recs Also consider “reversing” the key

BBW: File Header  Querying ASH, make sure  P1=current_file#  P2=current_block#  If not, use p1, p2 and not current_object# Time P1 P2 OBJN OTYPE FN BLOCKN BLOCK_TYPE : file header block 11: TOTO TABLE file header block SELECT A.OBJECT_ID FROM ALL_OBJECTS A, ( SELECT * FROM ALL_OBJECTS WHERE ROWNUM < 1000) B ORDER BY A.OBJECT_NAME

Copyright 2006 Kyle Hailey Temporary File #’s SQL> select file# from v$datafile; FILE# SQL> select file# from v$tempfile; FILE# SQL> show parameters db_files NAME VALUE db_files 200 Wait Temporary File#’s = Db_files + file# File# 202 = v$tempfile 2

BBW : File Header Time P1 P2 OBJN OTYPE FN BLOCKN BLOCK_TYPE : TOTO TABLE file header block Solution is make initial and next extent larger in Temp Table Space ADDM doesn’t say much

Buffer Exterminate  Buffer cache dynamically resized  V$SGA_DYNAMIC_COMPONENTS displays information about the dynamic SGA components. This view summarizes information based on all completed SGA resize operations since instance startup.  V$SGA_CURRENT_RESIZE_OPS displays information about SGA resize operations which are currently in progress. An operation can be a grow or a shrink of a dynamic SGA component.  V$SGA_DYNAMIC_FREE_MEMORY displays information about the amount of SGA memory available for future dynamic SGA resize operations. Alter system set db_cache_size=50M;

Summary Buffer Cache Waits 1.latch: cache buffers chains - find SQL  Eliminate hot spots 2.latch: cache buffers lru chain – increase sets 3.Free Buffer Wait - increase cache size 4.Buffer Busy Wait  Index : alleviate hot spots, partition  Table: add free lists or use ASSM  File Segment Header : looked at high extent allocations 5.Write Complete Waits - increase cache size