yade-dev team mailing list archive

[Bruno Chareyre <bruno.chareyre@xxxxxxxxxxx>]

On 22/03/11 11:43, Sergei D. wrote:
> 22.03.2011 13:31, Bruno Chareyre wrote:
>> Why do you think it should it break the algorithm?
>> It is because "interactions->insert(newI)" could insert two interactions
>> in the same list from different threads?
> No. It will breaks the Insertion Sort Algo, not
> interactions->insert/erase (the operations are thread's locked, so
> they are safely for parallelization.). But a parallelization of
> sorting is not as simple as #pramga parrallel for...
>
Well, paralellizing a "for" loop is very simple. I was wondering if
there was an obvious reason why it should break the algorithm in this
precise case.
It works according to Anton, so... it's worth examining.

B.


-- 
_______________
Bruno Chareyre
Associate Professor
ENSE³ - Grenoble INP
Lab. 3SR
BP 53 - 38041, Grenoble cedex 9 - France
Tél : +33 4 56 52 86 21
Fax : +33 4 76 82 70 43
________________