In this report we present some algorithms for the efficient computation of the histogram of distances in a large point-set. Two versions are employed: the first computes all distances, whereas the second computes only distances between neighbouring points. They can be viewed as particular cases of the computation of long- and short-range interactions, respectively. We considered various parallel and distributed computing platforms: heterogeneous network-based clusters, multi-core and many-core systems. Moreover, we briefly describe a Grid-enabled applications for the processing and visualization of remote data.
Analysis of multi-dimensional data on parallel and distributed computing systems
A Corana
2010
Abstract
In this report we present some algorithms for the efficient computation of the histogram of distances in a large point-set. Two versions are employed: the first computes all distances, whereas the second computes only distances between neighbouring points. They can be viewed as particular cases of the computation of long- and short-range interactions, respectively. We considered various parallel and distributed computing platforms: heterogeneous network-based clusters, multi-core and many-core systems. Moreover, we briefly describe a Grid-enabled applications for the processing and visualization of remote data.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
