Can you please share more what the benefits of using Intel ArBB are?
How are closures in ArBB different than the closures in Python or Erlang?
How does Intel ArBB's two-phase compilation work?
What does each phase do, respectively?
We have a heavy double complex typematrix multiply operation, but the size is small. For example,
[a1,a2, ... a12]T*[a1', ... a12'] where a1 is double complex type, a1' isconjugate complex number of a1.
we need to do20012x1 multply 1x12 =12x12 operationin 6us each time and keep doing in over hours.
Issuch operation suitable to use ArBB?
I am new to Intel ArBB, sometimes back i used TBB and got good performance benefit. Now my question is how does Intel ArBB compare to the other programming models in Intel PBB, such as TBB and Cilk Plus?
Could you answer this question?