搜索资源列表
goss
- 用GOSS解线性方程组 Dim i As Integer 循环变量 Dim j As Integer 循环变量 Dim k As Integer 循环变量 -with Goss solving linear equations Dim i As Integer Dim cycle variable j As In teger cycle variables As Integer Dim k cycle variables
hadoop-0.18.0-eclipse-plugin.r
- HADOOP 0.18.0 安装插件源代码,HADOOP 0.18.0 source code plug-ins installed
canon2
- 主要还是让A(i,j) B(i,j)进行移动A(i,i+j),B(i+j,j)，然后进能直接相乘。具体的内容可以看并行算法导论，-Matrix multiplication with the Cannon Algorithm: The Cannon Algorithm for matrix multiplication was presented in the course “Parallel and Distributed Algorithms “by Dr. Klauck. Sh
MPI_HyperQuicksort
- MPI (message passing protocol) based quicksort. HyperQuicksort version (original proposed by C.J Quinn) Tested and Developed in H.U.T by MonteCristo
MPI_RegularSamplingQuickSort
- Regular Sampling Quick Sort (general quicksort) MPI based. Original Proposed by C.J.Quinn. Tested and developed by MPI teams in H.U.T (monteCristo)
jacobi
- A: aij, 1<= i,j<=n b: 1<=i<=n x0: intial guess, 1<=i<=n tol: tolerance N maximum number of iterations k: number count of iteration Xm(:,k): X in each k iteration-Jacobi s method: In numerical linear algebra, the
strech
- 去斜率（strech）参考信号与回波信号混频后得到中频输出信号S(t)=Aexp(j*2*pi*f0*t+phase) 其中f0与回波延时的关系为： f0=k*delay_t K为线性调频斜率，delay_t为回波延时 将s(t)采样，FFT变换即可得到目标距离与频谱的关系。 Strech 信号测距 输入混频后的中频信号（图一），经采样及FFT变换得到频谱（图二） 再根据频谱与距离的关系式R=Tcf/2B显示出距离(图三) -Go slope (strech
j
- MPI实现Jacobi矩阵迭代，每迭代5次输出中间结果-MPI implementations Jacobi iteration matrix, each iteration 5 times the output of intermediate results
MartrixMultiply100.java.tar
- hadoop实现矩阵乘法 输入文件是M#i#j#Mij-hadoop achieve matrix multiplication input file is M# i# j# Mij
MPI-and-OpenMP-parallel-programming
- 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-&