搜索资源列表
Mpi_K_mean
- 很牛B的Mpi并行算法 很牛B的Mpi并行算法 很牛B的Mpi并行算法-very cattle B prostitutes parallel algorithm B is the cattle prostit utes parallel algorithm is cattle B The prostitutes parallel algorithm B is the cattle prostit utes parallel algorithm B is the cattle prostitute
BFS_CUDA
- 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance bet
jacobi
- Write an MPI program that solves a set of linear equations Ax = b with the 并行计算 Jacobi method. The root process reads the matrix A and the vector b from files. The file names have to be specified by the user as parameters.-Write an MPI p
vector_x_in_upper_matrix_mpi
- calculate vector x in Ax=b equation of the upper triangle matrix using pipeline mpi
Jacobi
- 线性方程组Jacobi迭代的并行计算程序，数据文件是A*x=b,A是4阶方阵的算例。(A*x=b, Jacobi, In Data.txt the Matrix is 4*4)
矩阵向量
- 带状划分的矩阵向量乘法。数据文件是40*40的算例。(The file is prepared for solving A*b, in the Date there is an example for A which is a 40*40 matrix)