English 中文(简体)
加速和再造林是否有不同的使用案例?
原标题:Do Accelerate and Repa have different use cases?
  • 时间:2011-06-07 03:12:04
  •  标签:
  • haskell
  • repa

我与Repa和Cupre一起玩.——两者都令人感兴趣,但当我使用自己和何时使用时,我可以 out。 他们是否共同成长、竞争或只是为了不同的问题?

最佳回答

Repa是一个高效的阵容建设和校对图书馆,在Haskell进行规划,在Haskell操作时间进行。 Repa依靠GHC的精华和熟效。 您可将任意的Haskell代码与Repa混为一谈(RepaFunction such as map)。 将Haskell职能作为参数。

加速是万国邮联和多核心国邮联方案拟订的内在语言。 加快工作取决于自己的汇编者和万国邮联/万国邮联的平行工作。 一部使用加速图书馆的法典实际上确实是进行阵列计算。 它产生一个加速方案,由加速制自行处理runtime codificationer,以产生实际处理您阵列数据的代码。 但在实践中,你应通知基本步骤,仅进口图书馆和<编码>CPU.run(A.map f xs) - 或GPU.run。 页: 1 更令人难以理解的区别是,加速功能的论据为:Exp a,如果是重复计算的话,或Acc a,如果是集体的话,则确保你坚持“

If you want to support GPUs in Haskell, Accelerate is the primary option. If you only need your code to run on CPUs, both Repa and Accelerate are good options.

问题回答

暂无回答




相关问题
Euler Problem in Haskell -- Can Someone Spot My Error

I m trying my hand at Euler Problem 4 in Haskell. It asks for that largest palindrome formed by multiplying two three-digit numbers. The problem was simple enough, and I thought my Haskell-fu was up ...

How does foldr work?

Can anybody explain how does foldr work? Take these examples: Prelude> foldr (-) 54 [10, 11] 53 Prelude> foldr (x y -> (x+y)/2) 54 [12, 4, 10, 6] 12.0 I am confused about these executions....

Efficient queue in Haskell

How can I efficiently implement a list data structure where I can have 2 views to the head and end of the list, that always point to a head a tail of a list without expensive calls to reverse. i.e: ...

Problem detecting cyclic numbers in Haskell

I am doing problem 61 at project Euler and came up with the following code (to test the case they give): p3 n = n*(n+1) `div` 2 p4 n = n*n p5 n = n*(3*n -1) `div` 2 p6 n = n*(2*n -1) p7 n = n*(5*n -3)...

Ways to get the middle of a list in Haskell?

I ve just started learning about Functional Programming, using Haskel. I m slowly getting through Erik Meijer s lectures on Channel 9 (I ve watched the first 4 so far) and in the 4th video Erik ...

haskell grouping problem

group :: Ord a => [(a, [b])] -> [(a, [b])] I want to look up all pairs that have the same fst, and merge them, by appending all the list of bs together where they have the same a and discarding ...

Closest equivalent to subprocess.communicate in Haskell

I want to do a popen() / python s subprocess.communicate from Haskell - start a program, give it stdin, and get its stdout/stderr. What s the most direct / Haskellish way to do this?

热门标签