22-1
所属分类:人工智能/神经网络/深度学习
开发工具:Visual C++
文件大小:4KB
下载次数:11
上传日期:2007-03-15 23:41:25
上 传 者:
vivid
说明: 经典排序,查找,二叉树相关算法的并行源代码实现
(classical order, locate, the binary tree algorithms to achieve parallel source code)
文件列表:
255940\fft.c (10722, 2003-07-14)
255940\dataIn.txt (24, 2003-07-14)
255940 (0, 2011-02-18)
1. compile:
mpicc fft.c -o fft -lm
2. run:
mpirun -np 4 fft
3. result:
Read from data file "dataIn.txt"
p(t) = 1.000000 + 3.000000t^1 + 3.000000t^2 + 1.000000t^3
q(t) = 1.000000t^1 + 2.000000t^2 + 1.000000t^3
After FFT r(t)=p(t)q(t)
r(t) = 1.000000t^1 + 5.000000t^2 + 10.000000t^3 + 10.000000t^4 + 5.000000t^5 + 1.000000t^6
Use prossor size = 4
Total running time = 0.016373(s)
Distribute data time = 0.006959(s)
Parallel compute time = 0.009414(s)
近期下载者:
相关文件:
收藏者: