Welcome![Sign In][Sign Up]
Location:
Search - MPI

Search list

[MPImatrix_multiply_use_mpi2

Description: matrix multiply using mpi (u should compile this file in a system that has the mpi library)
Platform: | Size: 1024 | Author: sddas | Hits:

[JSP/Java10.1.1.36.2863

Description: 编程 有关泊松方程的计算 使用MPI方法 -Programming related to the Poisson equation is calculated using MPI methods
Platform: | Size: 63488 | Author: rui | Hits:

[MPIPI

Description: 用MPI实现计算PI的值,用计算梯形面积的方法实现,主要用C-PI calculated by the value of MPI implementation
Platform: | Size: 1024 | Author: cxg | Hits:

[Windows DevelopgetProcessorList

Description: Get available processor list on a cluseter..used for MPI programs
Platform: | Size: 1024 | Author: Kary | Hits:

[MPIpru

Description: smallpt.cpp en MPI codigo de renderizado de smallpt.coo utilizando MPI
Platform: | Size: 3072 | Author: sandokan0250 | Hits:

[AlgorithmHybrid_Program_to_Find_Prime_Numbers

Description: Hybrid program using mpi and Open Mp to find primes from a list of numbers
Platform: | Size: 307200 | Author: rockyboy | Hits:

[Software EngineeringIntegral

Description: This file to know integral at MPI
Platform: | Size: 226304 | Author: wonderjole | Hits:

[Linux-UnixParallelProgramModel

Description: 介绍并行计算编程的模型和理论,掌握openMP,MPI,编写并行程序不再难。-introducing the model and theory of parallelling,mastering openMP,MPI,it is easy to program paralleling program
Platform: | Size: 3098624 | Author: topyang | Hits:

[Mathimatics-Numerical algorithms5

Description: MPI implementation for Matrix Multiplication using Ford Method
Platform: | Size: 3072 | Author: ahmed | Hits:

[Linux-Unixassgn3

Description: Canoy Game implemented in MPI C
Platform: | Size: 324608 | Author: ahmed | Hits:

[Mathimatics-Numerical algorithms1

Description: MPI implementation for Matrix Multiplication
Platform: | Size: 3072 | Author: ahmed | Hits:

[Data structsquick_sort

Description: 用MPI实现的快速排序算法。在VC环境下开发.-MPI implementation with fast sorting algorithms. Development in the VC environment.
Platform: | Size: 2048 | Author: 李光瑞 | Hits:

[Data structsspmain

Description: 用MPI实现的冒泡排序。在VC环境下开发。-Bubble sort implemented with MPI. Development in the VC environment.
Platform: | Size: 2048 | Author: 李光瑞 | Hits:

[MPIHello.c

Description: MPI hello world. Introduction
Platform: | Size: 1024 | Author: jackdear44 | Hits:

[MPIIntro.c

Description: MPI introduction to proce-MPI introduction to process
Platform: | Size: 1024 | Author: jackdear44 | Hits:

[MPIDynomicMANDELBRAT

Description: code mandelbart with mpi ,platform is visual c-code mandelbart with mpi ,platform is visual c++
Platform: | Size: 1024 | Author: mandazy | Hits:

[MPISumationwithbitbit

Description: this program calculate sumation n number with mpi tree
Platform: | Size: 1024 | Author: mandazy | Hits:

[MPIallGatherANDallReduce

Description: this program is example about Allreduce and Allgather with mpi
Platform: | Size: 1024 | Author: mandazy | Hits:

[Windows Developsorting

Description: Assumptions  There are p processors sorting n numbers.  Each processor begins with n=p numbers stored in the array x  All numbers are in the range 0 : : : M 􀀀 1  When the sorting algorithm ends, each processors has a sorted list of numbers and for i < j every number in processor i is less than every number in processor j  Each processor can compare two numbers and swap them (if necessary) in time .  Each machine can send data to one other machine at a time (but cannot send and receive at the same time)  It takes  + k= time to send k numbers to another machine  id speci es the identi er of the current machine  Local sort of k elements takes time approximately Ck log2 k Programming assignment (Due 4/20) Write a short program to estimate  on the Linux Lab machines. (This requires no parallelism) Programming assignment (Due 4/20) Write a short program using MPI to estimate  and in the Linux Lab. -Assumptions  There are p processors sorting n numbers.  Each processor begins with n=p numbers stored in the array x  All numbers are in the range 0 : : : M 􀀀 1  When the sorting algorithm ends, each processors has a sorted list of numbers and for i < j every number in processor i is less than every number in processor j  Each processor can compare two numbers and swap them (if necessary) in time .  Each machine can send data to one other machine at a time (but cannot send and receive at the same time)  It takes  + k= time to send k numbers to another machine  id speci es the identi er of the current machine  Local sort of k elements takes time approximately Ck log2 k Programming assignment (Due 4/20) Write a short program to estimate  on the Linux Lab machines. (This requires no parallelism) Programming assignment (Due 4/20) Write a short program using MPI to estimate  and in the Linux Lab.
Platform: | Size: 63488 | Author: ghn | Hits:

[AI-NN-PRparallelgenetic

Description: 使用并行遗传算法解决TSP问题,使用MPI函数库进行通信。-Using parallel genetic algorithm to solve TSP problem, use the MPI library for communication.
Platform: | Size: 1312768 | Author: wrq | Hits:
« 1 2 ... 45 46 47 48 49 50»

CodeBus www.codebus.net