java使用线程求素数和1000个0～0.9随机数_多线程实现求1到1000000的质数

package datastrucates.arrays.newprimenumber;

import java.util.ArrayList;

import java.util.List;

import java.util.concurrent.Callable;

import java.util.concurrent.ExecutorService;

import java.util.concurrent.Executors;

import java.util.concurrent.TimeUnit;

import java.util.concurrent.atomic.AtomicInteger;

public class CallablePrimeNumber {

private static int threadPoolSize=4;

private static int numberParts=4;

private static     AtomicInteger integer=new AtomicInteger();

/**

* 判断该数字是否是质数

*

* @param number

* @return

*/

public boolean isPrimeNumber(int number) {

if (number <= 1) {

return false;

}

for (int i = 2; i if (number % i == 0) {

return false;

} else {

continue;

}

}

return true;

}

public int getPrimeNums(int start,int end) {

for(int i=start;i<=end;i++) {

if(isPrimeNumber(i)) {

integer.getAndIncrement();

}

}

return integer.get();

}

public void sumPrimeNums(int number) {

int nums=number/numberParts;

List> callableList=new ArrayList>();

for(int i=0;iint start=i*nums+1;

int end=(numberParts-i==1)?number:start+nums-1;

callableList.add(new Callable() {

@Override

public Integer call() throws Exception {

return getPrimeNums(start,end);

}

});

}

ExecutorService executor=Executors.newFixedThreadPool(threadPoolSize);

try {

executor.invokeAll(callableList,10000,TimeUnit.SECONDS );

} catch (InterruptedException e) {

e.printStackTrace();

}

executor.shutdown();

System.out.println("count--------->"+integer.get());

}

public static void main(String[] args) {

CallablePrimeNumber number=new CallablePrimeNumber();

long startTime=System.currentTimeMillis();

number.sumPrimeNums(10000000);

long endTime=System.currentTimeMillis();

System.out.println((endTime-startTime)/1000+"s");

}

}