2 resultados para Loops parallelization
em Digital Peer Publishing
Resumo:
This article deals with complex material flow systems and series connections of conveyor and op-erating elements. These can be characterised by a specific availability. The thus resultant overall availabil-ity of necessary “technical throughput” of the individual elements for the achievement of a specified throughput. When the conveyor and operating elements are subjected to a stochastic distribution, the interposition of buffers is necessary but these can also lead to a reduction of the necessary throughput due faults. The system behaviour of complex installations can only be investigated by simulation. The parame-ter changes required in order to achieve specific target values can also be determined by simulation runs in iteration loops.
Resumo:
We present in this paper several contributions on the collision detection optimization centered on hardware performance. We focus on the broad phase which is the first step of the collision detection process and propose three new ways of parallelization of the well-known Sweep and Prune algorithm. We first developed a multi-core model takes into account the number of available cores. Multi-core architecture enables us to distribute geometric computations with use of multi-threading. Critical writing section and threads idling have been minimized by introducing new data structures for each thread. Programming with directives, like OpenMP, appears to be a good compromise for code portability. We then proposed a new GPU-based algorithm also based on the "Sweep and Prune" that has been adapted to multi-GPU architectures. Our technique is based on a spatial subdivision method used to distribute computations among GPUs. Results show that significant speed-up can be obtained by passing from 1 to 4 GPUs in a large-scale environment.