资源列表
[并行运算] noncollision
说明:实现4×4的数组元素的无冲突的存储,该算法不使用结构体,而直接使用了数组元素与下标之间的关系实现,比较巧妙,16×16可参照类似算法实现。-Realize 4 × 4 array of elements of the conflict-free storage, the algorithm does not use the structure, while the direct use of the array elements and the relationship between the<wxy> 在 2025-06-19 上传 | 大小:238kb | 下载:0
[并行运算] hello
说明:在fortran开发环境下,简单的并行程序示例-parallel algorithm practice," incidental mpi source, including eight for Queen s, Peddlers issue of 38 mpi Parallel Programming<houyongchang> 在 2025-06-19 上传 | 大小:236kb | 下载:0
[并行运算] tuopupaixu
说明:输出一个有向无环图(DAG)的拓扑排序。通过计算各顶点的入度数,删除入度为零的顶点,同时将该顶点指向的点的入度减一。重复此操作直到所有点都被输出。-Output a directed acyclic graph (DAG) topological sort. Through calculating the degree of each vertex deleting zero vertices into degrees, at the same time the vertex point to<李阳> 在 2025-06-19 上传 | 大小:239kb | 下载:0