mysql buffer 命中率_从MySQL的源码剖析Innodb buffer的命中率计算

按官方手册推荐Innodb buffer Hit Ratios的计算是:

100-((iReads / iReadRequests)*100)

iReads : mysql->status->Innodb_buffer_pool_reads

iReadRequests: mysql->status->Innodb_buffer_pool_read_requests

出处: http://dev.mysql.com/doc/mysql-monitor/2.0/en/mem_graphref.html

搜”Hit Ratios”

推荐有兴趣的同学把这个页面都看一下应该也会有很大收获.

另外在hackmysql: www.hackmysql.com网站上的: mysqlsqlreport中关于buffer命中计算是:

$ib_bp_read_ratio = sprintf "%.2f",

($stats{'Innodb_buffer_pool_read_requests'} ?

100 - ($stats{'Innodb_buffer_pool_reads'} /

$stats{'Innodb_buffer_pool_read_requests'}) * 100 :0);

即:

ib_bp_hit=100-(Innodb_buffer_pool_reads/Innodb_buffer_pool_read_requests)*100

另外我们知道查看Innodb Buffer Hit Ratios的地方是:复制代码 代码如下:show engine innodb statusG;

Buffer pool hit rate : XXXX/1000;

那个XXX/1000即是buffer pool hit ratios的命中.

这样也可以从代码里看一下这个bp命中计算:

storage/innobase/buf/buf0buf.c # void buf_print_io

storage/innodbase/include/buf0buf.h #struct buf_block_struct

在buf0buf.c 中的buf_print_io函数中可以看到:

void

buf_print_io(

if (buf_pool->n_page_gets > buf_pool->n_page_gets_old) {

fprintf(file, "Buffer pool hit rate %lu / 1000n",

(ulong)

(1000 - ((1000 * (buf_pool->n_pages_read

- buf_pool->n_pages_read_old))

/ (buf_pool->n_page_gets

- buf_pool->n_page_gets_old))));

} else {

fputs("No buffer pool page gets since the last printoutn",

file);

}

buf_pool->n_page_gets_old = buf_pool->n_page_gets;

buf_pool->n_pages_read_old = buf_pool->n_pages_read;

}

结合:

storageinnobaseincludebuf0buf.h中

struct buf_block_struct{

ulint n_pages_read; /* number read operations */

ulint n_page_gets; /* number of page gets performed;

also successful searches through

the adaptive hash index are

counted as page gets; this field

is NOT protected by the buffer

pool mutex */

ulint n_page_gets_old;/* n_page_gets when buf_print was

last time called: used to calculate

hit rate */

ulint n_pages_read_old;/* n_pages_read when buf_print was

last time called */

从这个来看innodb buffer hit Ratios的命中计算需要本次取的值和上次值做一个减法公式应该为

ib_bp_hit=1000 – (t2.iReads – t1.iReads)/(t2.iReadRequest – t1.iReadRequest)*1000

t(n): 时间点 两个时间间隔最少是30秒以上,在小意义不大.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值