Search - mpi-20

Search - mpi-20 - List

[Other resource] mpi-20 DL : 0: This document describes the MPI and MPI standards They are both extensions to the MPI standard The MPI part of the document contains clarications and corrections to the MPI standard and denes MPI The MPI part of the document describes additions to the MPI standard and denes MPI These include miscellaneous topics process creation and management onesided communications extended collective operations external interfaces IO and additional language bindings-This document describes the standards MPI and MPI They are both extensions to the standard MPI The MPI part of the document contains clari cations and corrections to the MPI standard and de nes The MPI MPI part of the document describes additions to the MPI standard and de nes MPI These include miscellaneous topics process creation and management one sided communications extended collective operations external interfaces I O and additional language bindings
Update : 2008-10-13 Size : 1.5mb Publisher : 张翟
[Mathimatics-Numerical algorithms] fft DL : 0: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一，1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn)，推进了FFT更深层、更广法的研究与应用。这是一个傅氏变换的MPI程序，用C语言实现。
Update : 2008-10-13 Size : 4.04kb Publisher : chj
[MPI] mpi-20 DL : 0: This document describes the MPI and MPI standards They are both extensions to the MPI standard The MPI part of the document contains clarications and corrections to the MPI standard and denes MPI The MPI part of the document describes additions to the MPI standard and denes MPI These include miscellaneous topics process creation and management onesided communications extended collective operations external interfaces IO and additional language bindings-This document describes the standards MPI and MPI They are both extensions to the standard MPI The MPI part of the document contains clari cations and corrections to the MPI standard and de nes The MPI MPI part of the document describes additions to the MPI standard and de nes MPI These include miscellaneous topics process creation and management one sided communications extended collective operations external interfaces I O and additional language bindings
Update : 2025-02-19 Size : 1.5mb Publisher : 张翟
[Mathimatics-Numerical algorithms] fft DL : 0: 离散傅里叶变换是20世纪60年代是计算复杂性研究的主要里程碑之一，1965年Cooley和Tukey所研究的计算离散傅里叶变换(Discrete Fourier Test)的快速傅氏变换(FFT)将计算量从О(n2)下降至О(nlogn)，推进了FFT更深层、更广法的研究与应用。这是一个傅氏变换的MPI程序，用C语言实现。-Discrete Fourier Transform of the 20th century 60 s computational complexity is a major milestone in one study, in 1965 Cooley and Tukey studied the calculation of discrete Fourier transform (Discrete Fourier Test) fast Fourier transform (FFT) calculation increased from О (n2) dropped to О (nlogn), the FFT to promote deeper, broader research and application of law. This is a Fourier transform of the MPI process, with C language.
Update : 2025-02-19 Size : 4kb Publisher : chj
[MPI] MPI DL : 0: 在visual studio2005中开发安装了MPICH2安装包-Developed in the visual studio2005 installed MPICH2 installation package
Update : 2025-02-19 Size : 669kb Publisher : jiangjuan
[Books] MPI DL : 0: 一本很不错的介绍MPI的书,非常非常不错,这下够20字了吧-A very good introduction to MPI' s book is very, very good, enough for 20 characters of the next bar ....
Update : 2025-02-19 Size : 836kb Publisher : 张龙
[Windows Develop] sorting DL : 0: 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 species the identier 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 species the identier 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.
Update : 2025-02-19 Size : 62kb Publisher : ghn
[Other] mpi-20 DL : 0: 通过该指南，可以了解MPI编程的一些基本理论知识，对初学者有较大帮助！--Through the guide, you can learn some basic theoretical knowledge of MPI programming beginners!-
Update : 2025-02-19 Size : 1.53mb Publisher : newton
[MPI] 20-1 DL : 0: JCOBI迭代并行MPI源代码，C语言代码-JCOBI iterative parallel MPI source code
Update : 2025-02-19 Size : 8kb Publisher : 刘敏
[MPI] test3 DL : 0: 基于MPI的卷积计算,数据矩阵：256*256 –原始矩阵设置：随机50个点设置为255，其余为0  卷积核：5*5 –明确注明所设计的卷积核  迭代次数：100 –每5次迭代保存一次数据矩阵 –通过20个结果矩阵，生成动画-MPI-based convolution calculation, data matrix: 256* 256- the original matrix setting: Random 50 points set to 255, the rest is 0  convolution kernel: 5* 5- clearly indicate the design of convolution kernel  iterations : 100- once every five iterations saved data matrix- matrix through 20 results generated animation
Update : 2025-02-19 Size : 3kb Publisher : 路东英