搜索资源列表
rank_sort
- 并行算法实践,经典排序,查找,二叉树相关算法的并行源代码实现-parallel algorithm practice, the classical sort, search, the binary tree algorithms to achieve parallel source code
psrs_sort
- 经典排序,查找,二叉树相关算法的并行源代码实现并行算法实践,-classical order, locate, Binary Tree parallel correlation algorithm source code parallel algorithms practice,
22-2
- 经典排序,查找,二叉树相关算法的并行源代码实现-classical order, locate, the binary tree algorithms to achieve parallel source code
22-1
- 经典排序,查找,二叉树相关算法的并行源代码实现-classical order, locate, the binary tree algorithms to achieve parallel source code
21-4
- 经典排序,查找,二叉树相关算法的并行源代码实现-classical order, locate, the binary tree algorithms to achieve parallel source code
17-1
- 经典排序,查找,二叉树相关算法的并行源代码实现-classical order, locate, the binary tree algorithms to achieve parallel source code
blackred1
- 在linux系统下，红黑排序算法的并行实现，该算法简洁、高效
mpiquiksort.rar
- 基于MPI的并行快速排序算法，可以通过并行快速排序提高排序速度,MPI-based parallel quick sort algorithm, you can sort through parallel quick sort to improve the speed
MPI-Sort
- 枚举、快速排序和正则采样排序的并行算法，附带说明，无解压密码-Enumeration, fast sorting and regular sampling of parallel sorting algorithms, annotated, non-decompression password
PageRank
- 并行计算环境下的网页排序算法 mapreduce框架，北大计算机系暑期课程项目-null
quick_sort
- 实现快速排序的并行算法源程序，希望对大家有帮助。-Fast parallel algorithm to sort the source, I hope all of you help.
13-1
- 并行算法：通过消息传递MPI实现排序，初学者比较好的示例-Parallel Algorithm: MPI message passing through the achievement of sequencing, a relatively good example for beginners
paralall_sort
- mpi实现并行排序算法，可以设置处理器节点个数并比较不同节点数目时的计算时间-mpi parallel sorting algorithm, you can set the number of processor nodes and compare the different number of nodes at the time of computing time
XSort_Submit
- 归并排序的并行算法 intel 多线程优化大赛-Parallel merge sort algorithm
rankSort
- 基于MPI的并行快速排序算法，VS2010编译运行通过-MPI-based parallel quick sort algorithm, VS2010 compiled to run through
quicksort
- 使用MPI编程实现快速排序的并行化 (1) 并行算法的设计 设计快速排序的并行化算法，说明并行化的算法的设计思想。 (2) MPI编程 使用MPI编程实现快速排序的并行化。 (3) 对运行结果的对比和分析。 -Quick Sort programming using MPI parallelization (1) parallel algorithm design parallel algorithm design quick sort, indicating paral
MergeSort
- 并行归并排序算法，基于mpi的并行归并排序算法-A parallel merge sort algorithm
MPI-and-OpenMP-parallel-programming
- 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-&
lab1
- 共享存储编程实验，用OpenMP实现并行的枚举排序算法和快速排序算法并与其串行算法进行比较(OpenMP parallel QuickSort)
MyGA-master
- 将节点按内存情况排序 将任务按内存需求情况排序 规则：将内存需求最小的节点先行分配在内存剩余最多的节点上(Sort nodes by memory and tasks by memory requirements Rule: the node with the least memory requirement is allocated to the node with the most remaining memory)