搜索资源列表
quiksort111111111
- 用ＯＰＥＮＭＰ编写的 并行实现快速排序的程序！-OPENMP prepared by the rapid parallel scheduling procedures.
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
sort
- java用集成和多态实现多种排序功能的比较 java用集成和多态实现多种排序功能的比较
blackred1
- 在linux系统下，红黑排序算法的并行实现，该算法简洁、高效
domain
- 在linux系统下G－S算法，用区域分解方法的并行实现，运行环境与红黑排序相同
serial_br
- 在linux系统下G－S算法，红黑排序方法的串行实现
omp_qs.zip
- 一个调用OpenMP的实现多线程快速排序的算法实现 gcc4.2 调试通过,A call to the realization of multi-threaded OpenMP Quick Sort Algorithm gcc4.2 debugging through
meijubympi
- 用mpi实现的枚举排序，测试请在mpi的并行环境中进行-Enumeration sorting using mpi implementation, testing in the mpi parallel environment for the conduct
mpi
- 基于MPI的并行快排和并行枚举排序的实现。属于MPI的入门级程序。-MPI-based parallel quick scheduling and parallel implementation enumeration sort. MPI belong to the entry-level procedures.
MPI_QuickSort
- MIP并行计算实现快速排序算法。在本篇中，我们首先对快速排序算法进行描述和实现，并在此基础上分析此算法的并行性，确定并行编程模式，最后给出该算法的MPI实现。-MIP fast parallel sorting algorithms. In this, we first describe a fast sorting algorithm and implementation, and on this basis of parallelism of this algorithm to determ
quicksort
- 快排的并行实现，使用openMP,程序自动生成随机数，分别使用单线程和多线程排序，并比较最后的结果-quick sort based on openMP
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
lab1
- 共享存储编程实验，用OpenMP实现并行的枚举排序算法和快速排序算法并与其串行算法进行比较(OpenMP parallel QuickSort)