Add to ORKGShortening the computation time of particle contact determination is an important issue in the field of particle analysis because it requires computational load. The paper, propose a Multi-color contact determination method and tried the parallel computation of the 16 threads by OpenMP in order to reduce the computation time. I also compared the following techniques for program optimization: Exclusive control, Redundant computation, and Multi-color contact determination method. As a result, the proposed method was confirmed quickly, about 2 times faster at 16 threads than the conventional method
International audienceWe have presented several contributions on the collision detection optimizatio...
Resampling in the particle filter algorithm can solve the algorithm's degeneracy problem. In order t...
The use of multithreading can enhance the performance of a software system. However, its excessive u...
Shortening the computation time of particle contact determination is an important issue in the field...
Many of the powder treated in practice are formed from a large number of particles. However, Sequent...
The construction of neighbour lists based on the linked cell method is investigated in the context o...
In this work the performance of the OpenMP, an API that supports multi-platform shared memory multip...
The main goal of this research is to use OpenMP, Posix Threads and Microsoft Parallel Patterns libra...
This thesis discusses how to optimize computational physics software for speed through maximizing th...
Processor scheduling techniques are used in conjunction to exploit the major paradigms of algorithmi...
Tim Sort is a sorting algorithm that combines Merge Sort and Binary Insertion Sort sorting algorithm...
summary:Le Bail fitting method is procedure used in the applied crystallography mainly during the cr...
Porting well known computer vision algorithms to low power, high performance computing devices such ...
The performance of an algorithm can be improved by using a parallel computing programming approach. ...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
International audienceWe have presented several contributions on the collision detection optimizatio...
Resampling in the particle filter algorithm can solve the algorithm's degeneracy problem. In order t...
The use of multithreading can enhance the performance of a software system. However, its excessive u...
Shortening the computation time of particle contact determination is an important issue in the field...
Many of the powder treated in practice are formed from a large number of particles. However, Sequent...
The construction of neighbour lists based on the linked cell method is investigated in the context o...
In this work the performance of the OpenMP, an API that supports multi-platform shared memory multip...
The main goal of this research is to use OpenMP, Posix Threads and Microsoft Parallel Patterns libra...
This thesis discusses how to optimize computational physics software for speed through maximizing th...
Processor scheduling techniques are used in conjunction to exploit the major paradigms of algorithmi...
Tim Sort is a sorting algorithm that combines Merge Sort and Binary Insertion Sort sorting algorithm...
summary:Le Bail fitting method is procedure used in the applied crystallography mainly during the cr...
Porting well known computer vision algorithms to low power, high performance computing devices such ...
The performance of an algorithm can be improved by using a parallel computing programming approach. ...
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitr...
International audienceWe have presented several contributions on the collision detection optimizatio...
Resampling in the particle filter algorithm can solve the algorithm's degeneracy problem. In order t...
The use of multithreading can enhance the performance of a software system. However, its excessive u...