1. 程式人生 > >A little problem for pt-pmp

A little problem for pt-pmp

https://bugs.launchpad.net/percona-toolkit/+bug/1320168

We use the pt-pmp (a variety for pmp !http://poormansprofiler.org/! by Percona ) tool a lot to analyze our online MySQL problem.

But when we execute the pmp, we have found  tps/qps of mysqld drop a lot, such as:

[10225s] threads: 256, tps: 8738.19, reads/s: 0.00, writes/s: 8735.39 [10230s] threads: 256, tps: 8749.81, reads/s: 0.00, writes/s: 8745.21 [10235s] threads: 256, tps: 8757.80, reads/s: 0.00, writes/s: 8763.00 [10240s] threads: 256, tps: 8772.80, reads/s: 0.00, writes/s: 8766.40
[10245s] threads: 256, tps: 284.80, reads/s: 0.00, writes/s: 278.40 [10250s] threads: 256, tps: 8036.65, reads/s: 0.00, writes/s: 8038.85 [10255s] threads: 256, tps: 8772.41, reads/s: 0.00, writes/s: 8773.01  We modify the code of pt-pmp to fix it. The patch is below:
143,148d142
< if gdb -nx --quiet --batch --readnever > /dev/null
2>&1; then < readnever=--readnever < else < readnever= < fi < 205c199 < gdb $readnever -ex "set pagination 0" -ex "thread apply all bt" -batch -p $OPT_p >> "${OPT_k:-$TMPDIR/percona-toolkit}" --- > gdb -ex "set pagination 0" -ex "thread apply all bt
" -batch -p $OPT_p >> "${OPT_k:-$TMPDIR/percona-toolkit}"

相關推薦

A little problem for pt-pmp

https://bugs.launchpad.net/percona-toolkit/+bug/1320168 We use the pt-pmp (a variety for pmp !http://poormansprofiler.org/! by Percona ) tool a lot to a

The EPA's Bold New Idea: A Little Bit of Pollution Is Actually Good for You

For years, the Environmental Protection Agency's regulation of radiation, carcinogens, and other toxic chemicals has been based on the cautious scientific

#25 We’re Sticking around for a Little Bit Longer & Winter Is Coming

#25 We’re Sticking around for a Little Bit Longer & Winter Is Coming“shallow focus photography of orange pumpkins” by Jonathan Talbert on UnsplashLast

【BZOJ2051】A Problem For Fun

Description 給出一個N個結點的樹,每條邊有一個正整數權值,定義兩個結點的距離為連線這兩個結點路徑上邊權的和。對於每個結點i,它到其他N-1個結點都有一個距離,將這些距離從小到大排序,輸出第K個距離。 Input 輸入檔案總共N行。第一行有兩個正

CentOS系統yum報錯Cannot find a valid baseurl for repo

val 成功 start network valid 搜索 解決 base 連接 今天在嘗試安裝apache2服務器時候遇到了問題:在使用新安裝的CentOS系統下使用yum命令行直接報錯。 搜索了一下解決方法,首先嘗試第一個,修改DNS vi /etc/resolv.co

P1865 A % B Problem

code 輸入輸出 說明 tin else 描述 sca ++ return 題目背景 題目名稱是吸引你點進來的 實際上該題還是很水的 題目描述 區間質數個數 輸入輸出格式 輸入格式: 一行兩個整數 詢問次數n,範圍m 接下來n行,每行兩個整數 l,r

poj3511--A Simple Problem with Integers(線段樹求和)

poj pac style som can com onos roman miss A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K

【數論線性篩】洛谷P1865 A%B problem

continue 個數 區間 str 輸出 數據 兩個 裸題 n) 題目背景 題目名稱是吸引你點進來的 實際上該題還是很水的 題目描述 區間質數個數 輸入輸出格式 輸入格式: 一行兩個整數 詢問次數n,範圍m 接下來n行,每行兩個整數 l,r 表示區間 輸出格式:

P1303 A*B Problem

cst clu ont tdi cnblogs ring b- max can 題目描述 求兩數的積。 輸入輸出格式 輸入格式: 兩個數 輸出格式: 積 輸入輸出樣例 輸入樣例#1: 1 2

線段樹專題 POJ3468 A Simple Problem with Integers

strong print style update else algo linker clas uil 題意:n個點。m個操作。兩種操作類型。C X Y K 表示區間[x,y]上每一個點值加k。Q X Y 求區間[x,y]的和 分析:線段樹區間求和,裸模板 註意

HDOJ1002-A + B Problem II(高精加)

change test case logs names div lar struct () har Problem Description I have a very simple problem for you. Given two integers A and B,

poj 3468 A Simple Problem with Integers

arch fin uil range swe next char () limit A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total

HDU 1402 A * B Problem Plus FFT

contain linker pri span stack pragma mod exce problem A * B Problem Plus Problem Description Calculate A * B. Input Each line

loj6157 A^B Problem (並查集)

所有 是否 一個點 ron blank problem 異或 loj 遍歷 題目: https://loj.ac/problem/6157 分析: 這種樹上異或,一般是采用分位考慮,但是這題即使分位,也會發現非常不好處理 這裏考慮維護一個點到其根的路徑的異或值 用

A Simple Problem About Truth Table

函數定義 進制轉換 blog binary expr cas 初始化 表達 n) 源代碼: #include<iostream> #include<string> #include<cmath> using namespace std

HPU 1002 A + B Problem II【大數】

lar 保存 memory positive test size mod ack auth A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/327

poj 3468 A Simple Problem with Integers(原來是一道簡單的線段樹區間修改用來練練splay)

long 兩個 可能 style push ios stream 區間 pan 題目鏈接:http://poj.org/problem?id=3468 題解:splay功能比線段樹強大當然代價就是有些操作比線段樹慢,這題用splay實現的比線段樹慢上一倍。線段樹用l

Week 1 # A A + B Problem II

res lines osi 可能 c代碼 turn contains inpu mean 原題描述: A - A + B Problem II I have a very simple problem for you. Given two integers A and B,

luogu1001 A+B Problem

而且 clas printf 一個 include main函數 int () div A+B Problem 題目描述 輸入兩個整數a,b,輸出它們的和(|a|,|b|<=10^9)。 註意 1、pascal使用integer會爆掉哦! 2、有負數哦! 3、c/c+

HDU 1402 A * B Problem Plus ——(大數乘法,FFT)

兩個 ret 處理 complex truct std spa strlen mes   因為剛學fft,想拿這題練練手,結果WA了個爽= =。   總結幾點犯的錯誤:   1.要註意處理前導零的問題。   2.一定要註意數組大小的問題。(前一個fft的題因為沒用到b數組,