【发布时间】:2011-06-07 19:27:04
【问题描述】:
我正在尝试计算 Pi,但我真正想要实现的是使用多个线程时的效率。该算法很简单:我在单位正方形中随机生成点,然后计算其中有多少点位于正方形内接的圆圈中。 (更多:http://math.fullerton.edu/mathews/n2003/montecarlopimod.html) 我的想法是水平分割正方形并为它的每个部分运行不同的线程。 但我得到的不是加速,而是延迟。任何想法为什么?代码如下:
public class TaskManager {
public static void main(String[] args) {
int threadsCount = 3;
int size = 10000000;
boolean isQuiet = false;
PiCalculator pi = new PiCalculator(size);
Thread tr[] = new Thread[threadsCount];
long time = -System.currentTimeMillis();
int i;
double s = 1.0/threadsCount;
int p = size/threadsCount;
for(i = 0; i < threadsCount; i++) {
PiRunnable r = new PiRunnable(pi, s*i, s*(1.0+i), p, isQuiet);
tr[i] = new Thread(r);
}
for(i = 0; i < threadsCount; i++) {
tr[i].start();
}
for(i = 0; i < threadsCount; i++) {
try {
tr[i].join();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
double myPi = 4.0*pi.getPointsInCircle()/pi.getPointsInSquare();
System.out.println(myPi + " time = " + (System.currentTimeMillis()+time));
}
}
public class PiRunnable implements Runnable {
PiCalculator pi;
private double minX;
private double maxX;
private int pointsToSpread;
public PiRunnable(PiCalculator pi, double minX, double maxX, int pointsToSpread, boolean isQuiet) {
super();
this.pi = pi;
this.minX = minX;
this.maxX = maxX;
this.pointsToSpread = pointsToSpread;
}
@Override
public void run() {
int n = countPointsInAreaInCircle(minX, maxX, pointsToSpread);
pi.addToPointsInCircle(n);
}
public int countPointsInAreaInCircle (double minX, double maxX, int pointsCount) {
double x;
double y;
int inCircle = 0;
for (int i = 0; i < pointsCount; i++) {
x = Math.random() * (maxX - minX) + minX;
y = Math.random();
if (x*x + y*y <= 1) {
inCircle++;
}
}
return inCircle;
}
}
public class PiCalculator {
private int pointsInSquare;
private int pointsInCircle;
public PiCalculator(int pointsInSquare) {
super();
this.pointsInSquare = pointsInSquare;
}
public synchronized void addToPointsInCircle (int pointsCount) {
this.pointsInCircle += pointsCount;
}
public synchronized int getPointsInCircle () {
return this.pointsInCircle;
}
public synchronized void setPointsInSquare (int pointsInSquare) {
this.pointsInSquare = pointsInSquare;
}
public synchronized int getPointsInSquare () {
return this.pointsInSquare;
}
}
一些结果: - 对于 3 个线程:“3.1424696 时间 = 2803” -for 1 个线程:“3.1416192 时间 = 2337”
【问题讨论】:
-
您是否在多核系统上运行?
-
我在 Intel core 2 duo 上运行。
-
他在加入之前就开始了所有这些,所以这没关系。如果您只有 2 个内核,那么使用超过 2 个线程是没有用的。您的应用程序完全受 CPU 限制,因此线程数多于内核数只会由于上下文切换的开销而减慢速度。
-
我在我的版本中使用了以下
final int threadsCount = Runtime.getRuntime().availableProcessors();
标签: java multithreading performance