CyclicBarrier应用:用10个线程求1到1000之和

来源:互联网 发布:js xmlhttprequest 编辑:程序博客网 时间:2024/05/24 00:29

用多个线程求和的方法有多种,这里给出一种应用CyclicBarrier求和的方法。

package com.java.basic.concurrent.CyclicBarrier;


import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.BrokenBarrierException;
import java.util.concurrent.CyclicBarrier;


/**
 * @Description 用10个线程来计算1到1000之和
 * @Author moudaen
 * @Since 2013年12月19日
 */


public class Count {


public static void main(String[] args) {
final List<Worker> list = new ArrayList<Worker>();
CyclicBarrier barrier = new CyclicBarrier(10, new Runnable() {
@Override
public void run() {
int result = 0;
for(Worker worker :list){
result += worker.getResult();
}
System.out.println("计算完成,结果为"+result);
}
});

int start = 0;
int end = 0;
Worker worker = null;
for(int i=0;i<10;i++){
start = i*100+1;
end = start+99;
worker = new Worker(start, end,barrier);
new Thread(worker).start();
list.add(worker);
}
}

}


class Worker implements Runnable{


private int result = 0;

private final int start;

private final int end;

private CyclicBarrier barrier;

public Worker(int start,int end,CyclicBarrier barrier) {
this.start = start;
this.end = end;
this.barrier = barrier;
}

@Override
public void run() {
int i = start;
for(;i<=end;i++){
this.result +=i;
}
try {
barrier.await();
} catch (InterruptedException e) {
e.printStackTrace();
} catch (BrokenBarrierException e) {
e.printStackTrace();
}
}

public int getResult(){
return this.result;
}
}

0 0
原创粉丝点击