NDLI: Exact and approximate computation of a histogram of pairwise distances between astronomical objects

Please wait, while we are loading the content...

DOME: towards the ASTRON & IBM center for exascale technology

ExaScale high performance computing in the square kilometer array

A polyphase filter for GPUs and multi-core processors

Intel® many integrated core (MIC) architecture: portability and performance efficiency study of radio astronomy algorithms

Exact and approximate computation of a histogram of pairwise distances between astronomical objects

Solar filaments detection using parallel programming in hybrid architectures

Parallel gravity: from embarrassingly parallel to hierarchical

SkuareView: client-server framework for accessing extremely large radio astronomy image data.

Exact and approximate computation of a histogram of pairwise distances between astronomical objects

Content Provider	ACM Digital Library
Author	Gibson, Garth Fink, Eugene Fu, Bin Carbonell, Jaime
Abstract	We compare several alternative approaches to computing correlation functions, which is a cosmological application for analyzing the distribution of matter in the universe. This computation involves counting the pairs of galaxies within a given distance from each other and building a histogram that shows the dependency of the number of pairs on the distance. The straightforward algorithm for counting the exact number of pairs has the $O(n^{2})$ time complexity, which is unacceptably slow for most astronomical and cosmological datasets, which include billions of objects. We analyze the performance of several alternative algorithms, including the exact computation with an $O(n^{(5/3)})$ average running time, an approximate computation with linear running time, and another approximate algorithm with sub-linear running time, based on sampling the given dataset and computing the correlation functions for the samples. We compare the accuracy of the described algorithms and analyze the tradeoff between their accuracy and running time. We also propose a novel hybrid approximation algorithm, which outperforms each other technique.
Starting Page	17
Ending Page	24
Page Count	8
File Format	PDF
ISBN	9781450313384
DOI	10.1145/2286976.2286983
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-18
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Approximation Astrophysics Hadoop kd-tree Escience Large-scale data Sampling
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in