29 Billets diffusés
11 Conversations entamées
Billets par catégories
Blog Roll
- Association for Computing Machinery TechNews (ACM)
- Go Parallel! (Dr. Dobbs)
- HPCwire (Tabor Communications, Inc.)
- insideHPC (John West)
- Joe Duffy's Weblog (Microsoft)
- Microsoft Parallel Programming Development Center (Microsoft Germany)
- MultiCoreInfo.com
- scalability.org (Scalable Informatics)
- Software Dev Blog (Intel Germany)
- Soft Talk Blog (Intel United Kingdom)
- The Moth (Microsoft)
Archives
Billets de krahnack 
Subarray Problem - A static NUMA-Aware approach
Auteur : krahnack (1 billets) le 24.11.2011 à 15:19
Remarques (3)
The subarray problem on a n*m matrix is sequentially solved using an algorithm known as the Kadane 2D algorithm. This algorithm has a O(n²m) complexity. The sequential algorithm is written using 3 loops : for i in (0..n) // <- We parallelize that for j in (i..n) for k in (0..m) //do work with matrix[j][k] [...]
