2 Unanswered Topics
Remove Filter
|
|
Hi everyone, I'm trying to parallelise a Gram-Schmidt algorithm. Here's the serial code: for( k = 0; k < m; k++ ) { for( i = 0; i < k; i++ ) { s = 0.0; for( j = 0; j < n; j++ ) { s += q[ i … |
|
I am trying to parallelize the [Guibas Stolfi delaunay triangulation](http://goanna.cs.rmit.edu.au/~gl/research/comp_geom/delaunay/delaunay.html) using openmp. There are two things to parallelize here- the mergesort(),which i did and the divide() where I am stuck. I have tried all possible approaches but in vain. The approach followed(divide n conquer) in divide() is same as that … |
The End.