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 ph0b 
|
http://ph0b.com/cv.html http://ph0b.com/cv-en.html |
Maximum Subarray Problem using TBB and Pipelines
Auteur : ph0b (1 billets) le 16.12.2011 à 13:01
Remarques (0)
Algorithm Kadane 2d's classic algorithm has a complexity of O(r²c), where r is the number of rows and c the number of cols. We use it when there is more columns than rows, but instead of tranposing the matrix for the opposite case, we developed a second algorithm that is O(c²r). It's basically a transposition [...]
