Location:
Search - MPI B
Search list
Description: 很牛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 prostitutes parallel count France
Platform: |
Size: 2584 |
Author: fdas |
Hits:
Description: 很牛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 prostitutes parallel count France
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 用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 between the root and the leaves.
Platform: |
Size: 1024 |
Author: iJuliet |
Hits:
Description: 介绍行列划分算法和矩阵相乘并行算法M P I 程序, 给出基于矩阵相乘并行算法的M P I 实现, 分析和讨
论处理器数目、复杂性、矩阵划分、B 子块传递、死锁避免和矩阵数据的获取等问题.-Introduction into the ranks of the matrix multiplication algorithm and parallel algorithm for MPI procedures, give parallel algorithm based on matrix multiplication of the MPI implementation, analysis and discussion of the number of processors, complexity, matrix breakdown, B sub-block transmission, to avoid deadlock and matrix data access and so on.
Platform: |
Size: 188416 |
Author: 澄海 |
Hits:
Description: 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 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.
Platform: |
Size: 2048 |
Author: 刘铭 |
Hits:
Description: SIESTA用于分子和固体的电子结构计算和分子动力学模拟。SIESTA使用标准的Kohn-Sham自恰密度泛函方法，结合局域密度近似(LDA-LSD)或广义梯度近似(GGA)。计算使用完全非局域形式(Kleinman-Bylander)的模守恒赝势。基组是数值原子轨道的线性组合(LCAO)。它允许任意个角动量，多个zeta，极化和截断轨道。计算中把电子波函和密度投影到实空间网格中，以计算Hartree和XC势，及其矩阵元素。除了标准的Rayleigh-Ritz本征态方法以外，程序还允许使用占据轨道的局域化线性组合。使得计算时间和内存随原子数线性标度，因而可以在一般的工作站上模拟几百个原子的体系。程序用Fortran 90编写，可以动态分配内存，因此当要计算的问题尺寸发生改变时，无需重新编译。程序可以编译为串行和并行（需要MPI）模式。
功能
总能量和部分能量
原子力
应力张量
电偶极矩
原子，轨道和键分析 (Mulliken)
电子密度
几何松弛，固定或者改变晶胞
常温分子动力学
可变晶胞动力学 (Parrinello-Rahman)
自旋极化计算（共线或者非共线）
BZ区的k-取样
态的局域和轨道投影密度
能带结构-SIESTA was born in 1996 to implement, in self consistent DFT, the order-N techniques developed for tight-binding in the early 1990s. Because order-N was carefully imposed in all the code, this was very efficient, specially for large systems and moderate precisions. Later, the need for higher precisions, and the addition of many new functionalities, imposed compromises to the order-N philosophy, but efficiency kept being one of SIESTA s strongest points.
Platform: |
Size: 7689216 |
Author: samuel |
Hits:
Description: Originally the definition of sorting in MPI is that lists are scattered around a series of working clusters before sorting. After sorting they still are scattered in those machines except that each segment is sorted and if one element in A is bigger than any element in B, then no element in A would not be smaller than any element in B. (Is it complicated? No, it just says segments are sorted.)
Platform: |
Size: 4096 |
Author: hutopila |
Hits:
Description: calculate vector x in Ax=b equation of the upper triangle matrix using pipeline mpi
Platform: |
Size: 50176 |
Author: alex |
Hits:
Description: 线性方程组Jacobi迭代的并行计算程序，数据文件是A*x=b,A是4阶方阵的算例。(A*x=b, Jacobi, In Data.txt the Matrix is 4*4)
Platform: |
Size: 2048 |
Author: jonajosejota |
Hits:
Description: 带状划分的矩阵向量乘法。数据文件是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)
Platform: |
Size: 5120 |
Author: jonajosejota |
Hits: