资源列表
CompQsortToMsort
- 分治算法与快速排序时间比较,根据运行时间比较其算法的优越性。-compare quicksort to mergesort
DataGeneration
- hadoop下mapreduce程序，实现对搜索日志文件中关键词的统计，通过并行运算得到结果-Under hadoop mapreduce program to realize the log file keyword search statistics, the results obtained by means of parallel computing
MatrixFullRank
- CPU和GPU上的利用CUDA实现矩阵的LU、QR和全秩分解、以及一些矩阵变换和运算程序。-On the CPU and GPU matrix by using CUDA, LU, QR, and full rank decomposition, as well as some matrix transformation and operation procedures.
GA_knapsack
- 使用遗传算法解决0-1背包问题，算法效率好-The use of genetic algorithm to solve 0-1 knapsack problem, a good algorithm efficiency
pthread
- 一个采用pthread求π的c语言程序，为初学者学习使用-One using pthread seeking π c language program for beginners to learn to use
SnuCL-1.3.1.tar
- 一种OpenCL语言扩展方法，能将单个GPU上编写的OpenCL程序扩展到集群环境中，使用该方法能增加OpenCL语言的可编程性。-One kind of OpenCL language extension methods on a single GPU can write OpenCL program extended to a clustered environment, the use of this method can increase the OpenCL language prog
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
voronoi
- 从Voronoi结构所脱胎的计算几何来看，Voronoi图是对平面n个离散点而言的，它把平面分为几个区，每一个区包括一个点，该点所在的区是到该点距离最近点的集合。-From the perspective of a Voronoi structure have spun out of the computational geometry, Voronoi diagram is for plane n discrete points, it put the plane is divided int
exp6_Uart
- xilinx FPGA的rs232 Verilog HDL程序-xilinx FPGA的rs232 Verilog HDL
hazy
- cuda并行计算去雾，在linux环境下，使用opencv库，nvcc hazy.cu 运行-cuda parallel computing to fog, in the linux environment, using opencv library, nvcc hazy.cu run
mini-omp-demo
- 20个并行计算的小例子，能够轻松的简单入门并行计算。-20 small example of parallel computing, can easily parallel computing simple entry.
MTJoin
- mapreduce源代码编程，工厂表与地区表的两表连接，使用的是reduce端连接-mapreduce Multiple table join source code