搜索资源列表
prime1
- 用Eratosthenes筛选算法,在1000000中求质数,分别用了串行算法,改进的串行算法,并行算法(openmp)实现,比较了执行时间
primes_omp
- 使用OpenMP方法求解质数，来自原书，但做了个人的修改，效率更高-more efficient with myself
prime-parallel
- 使用并行算法求解质数,求解速度基本上可以做到2倍的加速比-primes with parallel code
Prime
- JAVA多线程找质数。 输入为你想要创建的线程数和质数上限。 例： java PrimeSieve 10 3会利用三个线程输出10以下所有的质数-JAVA multi-threading to find prime numbers. Enter the number of threads you want to create the maximum number and quality. Example: java PrimeSieve 10 3 will make use of
test
- 并行sieve 方法寻找质数，openmp-sieve method for finding prime numbers based on openmp
prime
- 基于Java的并行计算，搜寻任意范围区间的所有等于质数乘积的数，可作为对并行计算的入门了解。-Java-based parallel search any range interval number is equal to the product of prime numbers, as parallel computing introductory understanding.