搜索资源列表
zy1
- 一．算法介绍: **数据结构: 1.可利用资源向量Available 2.最大需求矩阵Max 3.分配矩阵Allocation 4.需求矩阵Need **功能介绍: 模拟实现Dijkstra的银行家算法以避免死锁的出现.分两部分组成: 第一部分:银行家算法(扫描) 1．如果Request<=Need,则转向2 否则,出错 2．如果Request<=Available,则转向3,否则等待 3．系统试探分配请求的资源给进程 4．系统执行安
mpichbingxingdiama0711
- 基于cannon算法的MPI环境的并行程序原代码 能够计算超大型矩阵相乘，本人的毕业设计 绝对经典-cannon algorithm based on the environment of MPI parallel programming code to calculate the original super matrix multiplication. I graduated from the absolute classic design
mycannon
- 该程序是基于cannon算法实现的矩阵相乘运算，运行平台VS2005,需要设置环境变量。-The program is based on the cannon algorithm matrix multiplication operation, operation platform, VS2005, need to set environment variables.
matrix
- 矩阵相乘并行算法MPI源程序 并行思想加快速度-MPI parallel matrix multiplication algorithm source code parallel thinking speed
cengci_bingxing
- 一种层次聚类算法的并行改进，采用MPI编程，对三角矩阵的求解实现并行-A hierarchical clustering algorithm to improve parallelism, using MPI programming, parallel solving triangular matrix
80854418
- a,要求已知一个关系矩阵R,利用warshall算法求它的闭包R-A, require a known relationship matrix R, R using warshall algorithm for its closure
nzoblemmAlgorithm
- 算法分析实验报告：Strassen矩阵乘法,无问题,可以用的源码-Algorithm analysis lab report: Strassen matrix multiplication, no problem, can use the source code
poomjem
- 算法分析实验报告：Strassen矩阵乘法,无问题,可以用的源码(Algorithm analysis lab report: Strassen matrix multiplication, no problem, can use the source code)