We have recently developed a lattice-free simulation program in computational cell biology which needs the introduction and management of the biomechanical interactions of cells. These interactions are associated with short range forces which act on nearest-neighbors only. The forces act in the rearrangement of cells due to proliferation and cell growth and this requires a recalculation of the proximity relations at each time step. Here we describe the implementation of an algorithm to efficiently compute the proximity relations and designed to run on Graphics Processing Units (GPUs). The results of the first test runs on an NVidia Fermi GPU are encouraging: the algorithm has the potential to significantly boost the simulation program and t...
We present an scalable algorithm for short-range Molecular Dynamics which minimizes interprocessor c...
Abstract — We present a novel k-nearest neighbor search algorithm (KNNS) for proximity computation i...
The conventional Verlet table neighbor list algorithm is improved to reduce the number of unnecessar...
We recently developed a computational model of tumour growth. It is a cell- based model that can sim...
In Computer Graphics is usual the modelling of dynamic systems through particles. The simulation of ...
In this paper we present an efficient and general sorting-based approach for the neighbor search on ...
We discuss algorithms for lattice based computations, in particular lattice reduction, the de-tectio...
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture....
Various algorithms for evaluating nonbonded interactions in molecular dynamics (MD) simulations of m...
Searching of the interaction pairs and organization of the interaction processes are important steps...
We present projection sorting, an algorithmic approach to determining pairwise short-range forces be...
We present projection sorting, an algorithmic approach to determining pairwise short-range forces be...
A new algorithm for calculating intermolecular pair forces in molecular dynamics (MD) simulations on...
In particle systems simulation, the procedure of neighbour searching is usually a bottleneck in term...
International audienceFast determination of neighboring atoms is an essential step in molecular dyna...
We present an scalable algorithm for short-range Molecular Dynamics which minimizes interprocessor c...
Abstract — We present a novel k-nearest neighbor search algorithm (KNNS) for proximity computation i...
The conventional Verlet table neighbor list algorithm is improved to reduce the number of unnecessar...
We recently developed a computational model of tumour growth. It is a cell- based model that can sim...
In Computer Graphics is usual the modelling of dynamic systems through particles. The simulation of ...
In this paper we present an efficient and general sorting-based approach for the neighbor search on ...
We discuss algorithms for lattice based computations, in particular lattice reduction, the de-tectio...
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture....
Various algorithms for evaluating nonbonded interactions in molecular dynamics (MD) simulations of m...
Searching of the interaction pairs and organization of the interaction processes are important steps...
We present projection sorting, an algorithmic approach to determining pairwise short-range forces be...
We present projection sorting, an algorithmic approach to determining pairwise short-range forces be...
A new algorithm for calculating intermolecular pair forces in molecular dynamics (MD) simulations on...
In particle systems simulation, the procedure of neighbour searching is usually a bottleneck in term...
International audienceFast determination of neighboring atoms is an essential step in molecular dyna...
We present an scalable algorithm for short-range Molecular Dynamics which minimizes interprocessor c...
Abstract — We present a novel k-nearest neighbor search algorithm (KNNS) for proximity computation i...
The conventional Verlet table neighbor list algorithm is improved to reduce the number of unnecessar...