sysbench_cpu
5 core : 25.2848s
[root@jiangyi01.sqa.zmf /home/ahao.mah/ALIOS_QA/tools/sysbench]
#sysbench --num-threads=5 --max-time=100 --test=cpu --cpu-max-prime=50000 run
sysbench 0.5: multi-threaded system evaluation benchmark
Running the test with following options:
Number of threads: 5
Random number generator seed is 0 and will be ignored
Primer numbers limit: 50000
Threads started!
General statistics:
total time: 25.2848s
total number of events: 10000
total time taken by event execution: 126.3908s
response time:
min: 12.62ms
avg: 12.64ms
max: 16.26ms
approx. 95 percentile: 12.64ms
Threads fairness:
events (avg/stddev): 2000.0000/1.55
execution time (avg/stddev): 25.2782/0.00
指定5个线程,那么就是会占用5个core
[root@jiangyi01.sqa.zmf /home/ahao.mah]
#pid=`ps axu | grep sysbench | grep -v grep | awk '{print $2}'`;top -Hp $pid


10 core : 13.0198s


[root@jiangyi01.sqa.zmf /home/ahao.mah/ALIOS_QA/tools/sysbench]
#sysbench --num-threads=10 --max-time=100 --test=cpu --cpu-max-prime=50000 run
sysbench 0.5: multi-threaded system evaluation benchmark
Running the test with following options:
Number of threads: 10
Random number generator seed is 0 and will be ignored
Primer numbers limit: 50000
Threads started!
General statistics:
total time: 13.0198s
total number of events: 10000
total time taken by event execution: 130.1298s
response time:
min: 12.63ms
avg: 13.01ms
max: 20.71ms
approx. 95 percentile: 17.44ms
Threads fairness:
events (avg/stddev): 1000.0000/38.30
execution time (avg/stddev): 13.0130/0.00
--max-requests=指定“total number of events”


sysbench_cpu的更多相关文章
随机推荐
- Linux网络编程:UDP实现可靠的文件传输
我们知道,用TCP实现文件传输很简单.相对于TCP,因为UDP是面向无连接.不可靠的传输协议,所以我们需要考虑丢包和后发先至(包的顺序)的问题,所以我们想要实现UDP传输文件,则需要解决这两个问题.方 ...
- ios7 真机调试 设置 bitcode
用Xcode 7 beta 3在真机(iOS 8.3)上运行一下工程,结果发现工程编译不过.看了下问题,报的是以下错误: ld: ‘/Users/**/Framework/SDKs/PolymerPa ...
- 完美解决EditText和ScrollView的滚动冲突(上)
在网上搜了一下EditText和ScrollView的滚动冲突,发现差点儿全部的解决方式都是触摸EditText的时候就将事件交由EditText处理,否则才将事件交由ScrollView处理.这样确 ...
- LeetCode 1002. Find Common Characters (查找常用字符)
题目标签:Array, Hash Table 题目给了我们一个string array A,让我们找到common characters. 建立一个26 size 的int common array, ...
- Codeforces #2B The least round way(DP)
Description 有一个n*n的正整数矩阵,要你求一条从第一行第一列的格子到第n行第n列的路,使得你走过的格子里面的数乘起来的值末尾的零的个数最小.输出最小个数. Input 第一行包括1个数n ...
- 解析java中volatilekeyword
在java多线程编程中常常volatile,有时候这个keyword和synchronized 或者lock常常有人混淆.详细解析例如以下: 在多线程的环境中会存在成员变量可见性问题: java的每一 ...
- Prevent the "split brain" by configuring the majority of nodes
## Prevent the "split brain" by configuring the majority of nodes (total number of nodes / ...
- Robot Framework 搭建和RIDE(GUI) 的环境
在windows x64的环境上进行安装,集成Selenium2和AutoIt的libraries,以下安装步骤在win 7,win 8.1,win 10, win 2012 R2上测试通过 1. 下 ...
- 机器视觉: LBP-TOP
之前介绍过机器视觉中常用到的一种特征:LBP http://blog.csdn.net/matrix_space/article/details/50481641 LBP可以有效地处理光照变化,在纹理 ...
- [HNOI2011]XOR与路径
https://zybuluo.com/mdeditor#1094266 标签(空格分隔): 高斯消元 期望 题面 从 1 号节点开始,以相等的概率,随机选择与当前节点相关联的某条边,并沿这条边走到下 ...