搜索资源列表
BFS_CUDA
- 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance bet
BinarySearch
- A program written by C++ which is used to search using binary search concept on parallel processes,,,,wishing it is useful
lab4.c.tar
- Search for primes using MPI-Search for primes using MPI
MPI
- Search of number of Pi. Multiprocessing realisation. MPI (RUS) +Russian comments-Search of number of Pi. Multiprocessing realisation. MPI (RUS)+Russian comments
Q2
- parallel array search MPI program that searches for an element in an integer array of N elements.
Assignment-Sharp6
- This simple array search using MPI API. Array is 2D.-This is simple array search using MPI API. Array is 2D.
npsm
- MPI string search p1
linear_search_MPI
- Linear search algorithm written by c++ and using MPI Libraries
evenodd-transport-sort-search
- PARALLEL MERGESORT USING MPI
MPI-and-OpenMP-parallel-programming
- 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-&