Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 185

The DOI matches its Crossref record.

A sparse octree gravitational N-body code that runs entirely on the GPU processor

Open access
Bédorf, Jeroen, Gaburov, Evghenii, Portegies Zwart, Simon · 2012 · Journal of Computational Physics

Abstract

We present the implementation and performance of a new gravitational N-body tree-code that is specifically designed for the graphics processing unit (GPU).1The code is publicly available at: http://castle.strw.leidenuniv.nl/software.html.1 All parts of the tree-code algorithm are executed on the GPU. We present algorithms for parallel construction and traversing of sparse octrees. These algorithms are implemented in CUDA and tested on NVIDIA GPUs, but they are portable to OpenCL and can easily be used on many-core devices from other manufacturers. This portability is achieved by using general parallel-scan and sort methods. The gravitational tree-code outperforms tuned CPU code during the tree-construction and shows a performance improvement of more than a factor 20 overall, resulting in a processing rate of more than 2.8 million particles per second.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.jcp.2011.12.024

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 185

Metadata

Authors
Bédorf, J., Gaburov, E., & Portegies Zwart, S.
Venue
Journal of Computational Physics
Publisher
Elsevier BV
Published
2012-04
Volume
231
Issue
7
Pages
2825-2839
ISSN
0021-9991 (ISSN-L)
OpenAlex
W2006543911
Cited by
185
References
0
FWCI
21.97
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A sparse octree gravitational N-body code that runs entirely on the GPU processor. https://app.cochat.ai/papers/10.1016/j.jcp.2011.12.024
The paper
Bédorf, J., Gaburov, E., & Portegies Zwart, S. (2012). A sparse octree gravitational N-body code that runs entirely on the GPU processor. Journal of Computational Physics. https://doi.org/10.1016/j.jcp.2011.12.024

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.