Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Mailing Lists -> Oracle-L -> Re: recreable/freeable chunks

Re: recreable/freeable chunks

From: K Gopalakrishnan <kaygopal_at_yahoo.com>
Date: Tue, 06 Jan 2004 07:44:26 -0800
Message-ID: <F001.005DBDA1.20040106074426@fatcity.com>


Tanel:

You are right. But the actual freeing process (from the re-creatable chunks) is quite different from what you have explained. The recreatable chunks (they are freeable, but can be re-creatable if required as you have explained) will be falling in two catagories.

They are either pinned or un pinned. The unpinned list again has two separate lists (two LRU lists, one for transient and another one is for recurrent), and the freeing process starts from transient list.

IF we don't get the required memory, then it is moved to the other list, i.e recurrent chunk LRU and the search ends when the required size is found. I think 8 chunks are freed in the previous list before it shifting to the recurrent list. If the process doesn't get the required free memory, it will try to allocate from hidden memory before signalling ORA-04031.


Have a nice day !!

Best Regards,
K Gopalakrishnan,
Bangalore, INDIA.
-- 
Please see the official ORACLE-L FAQ: http://www.orafaq.net
-- 
Author: K Gopalakrishnan
  INET: kaygopal_at_yahoo.com

Fat City Network Services    -- 858-538-5051 http://www.fatcity.com
San Diego, California        -- Mailing list and web hosting services
---------------------------------------------------------------------
To REMOVE yourself from this mailing list, send an E-Mail message
to: ListGuru_at_fatcity.com (note EXACT spelling of 'ListGuru') and in
the message BODY, include a line containing: UNSUB ORACLE-L
(or the name of mailing list you want to be removed from).  You may
also send the HELP command for other information (like subscribing).
Received on Tue Jan 06 2004 - 09:44:26 CST

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US