Position: Home page » Pool » BFC pit

BFC pit

Publish: 2021-04-16 08:07:09
1. BFC Lefu digital currency can be purchased on the digital currency platform supporting its transactions
BFC (bright future coin) is a new generation of cryptocurrency. It is based on the Internet open source scrypt algorithm technology, POW workload proof + POS equity proof consensus mechanism, and adopts the point-to-point network development block chain and decentralized distributed cryptocurrency, which can not be created and copied by anyone
however, this is just a slogan. In fact, it still sells cloud mining machines, and the source code is not disclosed. Mining may be just a cover. The real purpose is to sell the miner
this kind of currency is different from bitcoin, Ruitai coin, Laite coin and Weimeng coin in that the basic information is open and transparent. It has a very big investment risk.
2. A shared pool has subpools (starting with 9i) and each subpool has sub-subpools or rations (starting with 10gR2 I think). It's easy to understand why there're subpools; each subpool is managed pretty much independently, with its own LRU list etc., and all subpools have the same functionality. But rations are different. Each one holds different types of objects. According to heapmp, as shown in Jonathan Lewis's "Oracle Core Essential Internals" p.184, dictionary cache is in ration 1, heap 0 (cursor head or parent cursor) in ration 2, SQLArea (heap 6) in ration 3.[note] Different types of objects have different characteristics. Within each type, objects have similar characteristics, such as size requirement, how long they stay in memory, etc. Oracle's work on shared pool rations is kind of like Solaris or Linux kernel slab. A chunk of memory is allocated from a specific ration (slab) depending on what function you want to use this memory chunk for. There're of course differences. A Solaris or Linux kernel has many slabs, while there're only 4 Oracle shared pool rations. Each slab is exclusively dedicated to one type of objects, such as inode_cache, nfs_page. A ration can contain various types of objects; the rule about what shared pool objects are in what ration is not very strict.

Other than Jonathan Lewis's book, this note

Bug 14311437 : ORA-600 [5351], ORA-600 [4000] AND ORA-4031 OCCURING IN GOLDEN GATE AND TIMESTEN

talks about the concept of rations, and more or less satisfy my curiosity why it's called "ration", a term that suggests time or how long something lasts.

One paragraph (Solution c) in

LCK temporarily stuck waiting for latch 'Child row cache objects' (Doc ID 843638.1)

also talks about rations.

The fixed table showing rations is x$ksmsp_nwex. You can find a query using this table in

Bug 14020215 : ORA-4031 WITH 7 SUBPOOLS AND DURATIONS THEN CPU SPIKES TO 100%

______________
[note]
On an 11.2.0.3 database, I have rations enabled (_enable_shared_pool_rations is TRUE). If you don't use ASMM nor AMM, you may have to manually set this parameter to true and bounce the database. I create a level 2 heapmp (oradebug mp heapmp 2) and manually split the trace file into four files, each for one ration of subpool 1. Then I aggregate on the memory chunk usage string and see what type of usage is the most common in each ration.

$ cut -c53-67 ration1-0 | sort | uniq -c | sort -rn | head
7127 KQR PO <-- "KQR PO" row cache parent objects are very common in ration 0
2826 KGLHD <-- Library cache handles are common too
287
28
27 SQLA^c22c7d28
27 KGLH0^c22c7d28
23 SQLA^7e6b9434
23 KGLH0^7e6b9434
20 SQLA^a2ac011a
20 perm
$ cut -c53-67 ration1-1 | sort | uniq -c | sort -rn | head
10578 KGLHD <-- lots of library cache handles in ration 1
7127 KQR PO
6588 KGLDA
2703
1217 ges resource
183
143 parameter table
72 name-service
28 KGLNA
19 KKSSP
$ cut -c53-67 ration1-2 | sort | uniq -c | sort -rn | head
8546
247
191 KGLH0^9e6af5b8 <-- not fair to include "random" numbers (SQL hash values) in uniq -c
53 KGLH0^52ccb2f2
52 KGLH0^d7bcc960
49 KGLH0^c22c7d28
49 KGLH0^1a8436ae
45 KGLH0^a2ac011a
35 KGLH0^d9085754
35 KGLH0^c5be8292
$ cut -c53-57 ration1-2 | sort | uniq -c | sort -rn | head -5
8546
8197 KGLH0 <-- So cut without the random part; we see 8197 entries for heap 0 in ration 2
247
175 PRTMV
115 PRTDS
$ cut -c53-67 ration1-3 | sort | uniq -c | sort -rn | head
21323
2810 SQLA^b3947bfc
1168 SQLA^52ccb2f2
1104 SQLA^d7bcc960
1020 SQLA^1a8436ae
401 SQLA^8bfc3f48
297 SQLA^c22c7d28
270
240 SQLA^a2ac011a
234 SQLA^b91ee9fa
[oracle@dctrpdbms3b trace]$ cut -c53-57 ration1-3 | sort | uniq -c | sort -rn | head -5
21323
18019 SQLA^ <-- remove the random part; we see most entries in ration 3 are SQL Area
1022 KGLS^
757 PLMCD
454 PLDIA
Hot content
Inn digger Publish: 2021-05-29 20:04:36 Views: 341
Purchase of virtual currency in trust contract dispute Publish: 2021-05-29 20:04:33 Views: 942
Blockchain trust machine Publish: 2021-05-29 20:04:26 Views: 720
Brief introduction of ant mine Publish: 2021-05-29 20:04:25 Views: 848
Will digital currency open in November Publish: 2021-05-29 19:56:16 Views: 861
Global digital currency asset exchange Publish: 2021-05-29 19:54:29 Views: 603
Mining chip machine S11 Publish: 2021-05-29 19:54:26 Views: 945
Ethereum algorithm Sha3 Publish: 2021-05-29 19:52:40 Views: 643
Talking about blockchain is not reliable Publish: 2021-05-29 19:52:26 Views: 754
Mining machine node query Publish: 2021-05-29 19:36:37 Views: 750