{"id":10777,"date":"2013-10-22T23:29:54","date_gmt":"2013-10-22T20:29:54","guid":{"rendered":"http:\/\/hgpu.org\/?p=10777"},"modified":"2013-10-22T23:29:54","modified_gmt":"2013-10-22T20:29:54","slug":"2hot-an-improved-parallel-hashed-oct-tree-n-body-algorithm-for-cosmological-simulation","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=10777","title":{"rendered":"2HOT: An Improved Parallel Hashed Oct-Tree N-Body Algorithm for Cosmological Simulation"},"content":{"rendered":"<p>We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (2^18) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (4096^3) particle cosmological simulations, accounting for 4&#215;10^20 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>We report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (2^18) processors. We present error analysis and scientific application results from a series of more than ten 69 [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[36,96,89,3],"tags":[1787,1794,803,14,723,97,258,20,1390,1241],"class_list":["post-10777","post","type-post","status-publish","format-standard","hentry","category-algorithms","category-astrophysics","category-nvidia-cuda","category-paper","tag-algorithms","tag-astrophysics","tag-cosmology","tag-cuda","tag-fast-multipole-method","tag-instrumentation-and-methods-for-astrophysics","tag-n-body-simulation","tag-nvidia","tag-tesla-k20","tag-tesla-m2090"],"views":4263,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/10777","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=10777"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/10777\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=10777"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=10777"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=10777"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}