搜索资源列表
convhull
- 设平面上n个点为 ，坐标原点为 。可按照下面方法求得包含这n个点的凸多边形。 (1)求最右边点，即x坐标最大点，设为 。 (2) 以 点为中心，在其余 个点中选取与 逆时针旋转角度最小的点，设为 。 (3)再以 点为中心，在其余 个点中选取与 逆时针旋转角度最小的点 。如此类推，直到新选取的点与 点重合为止。设已求得多边形k个点依次为 ，其中第 点与第1点重合。则分别以点 为三角形顶点计算面积并求和即可。 -Let n points in the plane as the
matrixsum
- sum of matrix in c++ and simulate in mpi area .
cuda_reduce
- cuda sum reduction with loop unrolling and bank-conflict avoided
vectorAdd
- Nvidia GPU实现的向量相加程序，对学习CUDA技术的初学者有很强的借鉴作用-Nvidia GPU implementation of the vector sum process, to learn CUDA technology, have a strong reference for beginners
CJGL
- 算1到的和100 之和 并算出偶数之和 算出奇数之积-Operator 1 and 100, and calculate the sum of even numbers and calculate the product of an odd number
lab6_dika
- calculate the sum of ellements in array
hypercube_array_sum
- MPI paralle c code for hypercube array sum
array_sum
- parallel array sum c code with MPI
mpi_arr
- a sample MPI program with c that calc array sum
scan
- 用CUDA计算数组的并行求和运算，在下个数据输入前进行上一次的数据计算-This example demonstrates an efficient CUDA implementation of parallel prefix sum, also known as "scan". Given an array of numbers, scan computes a new array in which each element is the sum of all the elements bef
main
- 1加到100的并行程序 分为1到50 和51到100两块 作为并行程序的熟悉用-sum from 1 to100 (parallel arithmetic)
cuda_sum
- 一个基础的cuda例子， 用于矢量求和。-A basis for the cuda example, the vector sum
send
- a simple MPI code for calculate sum of n number
selected
- Example_Reduce编程模型实现海量数据处理—数字求和-Hadoop学习-Example_Reduce programming model to achieve massive data processing- Digital Sum-Hadoop learning
prefix-sum
- Prefix sums are trivial to compute in sequential models of computation, by using the formula yi = yi − 1 + xi to compute each output value in sequence order. However, despite their ease of computation, prefix sums are a useful primitive in certa
code
- parallel processing matrix. calculated the sum of elements of the column specified by the user at the command line
vector-sum
- CUDA的矢量求和 用于CUDA5.0+VS2010，帮助学习GPU加速-vector sum for cuda
mpi_sum
- 基于并行编程的一个MPI实现累加求和的运算。-MPI sum function！