问题描述
大数据量求和,比如,百万个整数求和
多线程实现
接口
public interface Calculator {
long sumUp(long[] numbers);
}
实现类
/**
* @program: arask
* @description: executor
* @author: fubowen
* @create: 2020-06-28 11:17
**/
public class ExecutorServiceCalculator implements Calculator{
private int parallism;
private ExecutorService pool;
//构造方法
public ExecutorServiceCalculator(){
parallism=Runtime.getRuntime().availableProcessors();
pool= Executors.newFixedThreadPool(parallism);
}
//求和任务类,内部类
private static class SumTask implements Callable<Long>{
private long[] numbers;
private int from;
private int to;
SumTask(long[] numbers,int from,int to){
this.numbers=numbers;
this.from=from;
this.to=to;
}
//求和方法
@Override
public Long call() throws Exception {
long total=0;
for (int i=from;i<=to;i++) {
total+=numbers[i];
}
return total;
}
}
//求和
@Override
public long sumUp(long[] numbers) {
List<Future<Long>> results=new ArrayList<>();
//大任务分成小任务,数组分成部分,根据线程数。每个线程计算一部分,结果合并
int part=numbers.length/parallism;
for (int i = 0; i <parallism ; i++) {
//开始下标
int from=i*part;
//结束下标
int to=(i==parallism-1)?numbers.length-1:(i+1)*part-1;
//创建启动线程,保存结果
results.add( pool.submit(new SumTask(numbers,from,to)));
}
//线程结果求和
long total=0;
for (Future<Long> future :results) {
try {
total = total + future.get();
} catch (Exception e) {
e.printStackTrace();
}
}
return total;
}
}
测试代码
/**
* @program: arask
* @description: 求和测试类
* @author: fubowen
* @create: 2020-06-28 10:41
**/
public class CalculatorTest {
public static void main(String[] args) {
long length=100000000L;
Calculator calculator=new ExecutorServiceCalculator();
//测试数据,数组,连续整数
long[] numbers= LongStream.rangeClosed(1,length).toArray();
long startTime=System.currentTimeMillis();
//求和
long sum=calculator.sumUp(numbers);
long endTime=System.currentTimeMillis();
System.out.println("耗时:"+(endTime-startTime)+"ms");
System.out.println("结果:"+sum);
}
}