SC13 Home > SC13 Schedule > SC13 Presentation - 2HOT: An Improved Parallel Hashed Oct-Tree N-body Algorithm for Cosmological Simulation

SCHEDULE: NOV 16-22, 2013

When viewing the Technical Program schedule, on the far righthand side is a column labeled "PLANNER." Use this planner to build your own schedule. Once you select an event and want to add it to your personal schedule, just click on the calendar icon of your choice (outlook calendar, ical calendar or google calendar) and that event will be stored there. As you select events in this manner, you will have your own schedule to guide you through the week.

2HOT: An Improved Parallel Hashed Oct-Tree N-body Algorithm for Cosmological Simulation

SESSION: Physical Frontiers

EVENT TYPE: Papers, Awards, Best Paper Finalists

TIME: 4:30PM - 5:00PM

SESSION CHAIR: Richard Vuduc

AUTHOR(S):Michael S. Warren

ROOM:201/203

ABSTRACT:
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 x 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.

Chair/Author Details:

Richard Vuduc (Chair) - Georgia Institute of Technology

Michael S. Warren - Los Alamos National Laboratory

Add to iCal  Click here to download .ics calendar file

Add to Outlook  Click here to download .vcs calendar file

Add to Google Calendarss  Click here to add event to your Google Calendar

The full paper can be found in the ACM Digital Library