搜索资源列表
计算1000以内的素数
- 这是一个可以计算1000以内的素数算法 觉得还不错-This a 1000 can be calculated within the prime number algorithm also feel good
ecmnet20ksrc
- 分布式大数分解程序源码，可以再多台机器上利用数域筛法分解大素数。-Distributed integer factorization program source code, the more the machine can use the number field sieve factoring large prime numbers.
asil_egemen_findPrimesParallel.c
- MPI Efficient Finding Prime
include1
- MPI prime numbers. program for generating prime numbers
prnew
- Program in MPI to find prime numbers in an intervel of two numbers
RSA
- RSA 原理： 选取两个不同的大素数p、q，并计算N=p*q 选取小素数d，并计算e，使d*e (p-1)(q-1)=1 -RSA works: select two different large prime numbers p, q, and compute N = p* q Select the small prime d, and calculate the e, so d* e (p-1) (q-1) = 1
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
ques_2
- openMP program for calculating prime numbers using sieve of erastothesis algorithm.
primes
- CnC中查找素数的并行 这是一个学习cnc很好的例子-How to find prime numbers in concurrent program. it s very useful in learning cnc.
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.
ex1
- CUDA Prime number generating with GPU
MPI_prime
- MPI 产生2到n之间的素数,n作为命令行的参数。含有makefile.-MPI is a prime number between 2 to n, n as a command line parameter. Containing makefile.
prime
- 使用openmp实现2~1000000间素数的判断和输出 输出到文件中-OpenMP 2 to 1 million primes judgment and output to a file
sushudayin
- 用概率算法打印10~1000内素数，并与确定性算法比较出错概率-The probabilistic algorithms Print 10 to 1000 within a prime number, and error probability compared with the deterministic algorithm
New-folder2
- MPI code for Prime Math Is tested
5
- 提示用户输入一个整数，并判断是否是素数，如果是将输出它本身，否则输出所有的真因子-Prompts the user to enter an integer, and determine whether it is a prime number, and if the output itself, otherwise the output of all the true factor