GP2PCF: Computation of 2-point correlation functions

Discussion topics for individual codes
Post Reply
User avatar
Guardian of the Codes
Posts: 1135
Joined: Wed Aug 04, 2004 4:18 pm
Location: Washington, DC

GP2PCF: Brute-force computation of 2-point correlation functions

Post by owlice » Sat Oct 06, 2012 11:50 pm

[c]GP2PCF: Brute-force computation of 2-point correlation functions[/c][/b]
Abstract: The two-point correlation function is a simple statistic that quantifies the clustering of a given distribution of objects. In studies of the large scale structure of the Universe, it is an important tool containing information about the matter clustering and the evolution of the Universe at different cosmological epochs. A classical application of this statistic is the galaxy-galaxy correlation function to find constraints on the parameter Omega_m or the location of the baryonic acoustic oscillation peak. This calculation, however, is very expensive in terms of computer power and Graphics Processing Units provide one solution for efficient analysis of the increasingly larger galaxy surveys that are currently taking place.

GP2PCF is a public code in CUDA for performing this computation; with a single GPU board it is possible to achieve 120-fold speedups with respect to a standard implementation in C running on a single CPU. With respect to other solutions such as k-trees the improvement is of a factor of a few retaining full precision. The speedup is comparable to running in parallel in a cluster of O(100) cores.

Credit: Cárdenas-Montes, Miguel; Ponce, Rafael


Bibcode: 2012ascl.soft10001C

ID: ascl:1210.001
Last edited by Ada Coda on Wed May 01, 2019 3:43 pm, edited 1 time in total.
Reason: Updated code entry.
Code-seeking owl at your service

Post Reply