BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250626T234543Z
LOCATION:B310
DTSTART;TZID=America/New_York:20241117T153000
DTEND;TZID=America/New_York:20241117T155500
UID:submissions.supercomputing.org_SC24_sess737_ws_ia108@linklings.com
SUMMARY:Efficient Tree-based Parallel Algorithms for N-Body Simulations Us
 ing C++ Standard Parallelism
DESCRIPTION:Thomas Lane Cassell and Tom Deakin (University of Bristol, Eng
 land); Aksel Alpay and Vincent Heuveline (Heidelberg University); and Gonz
 alo Brito Gadeschi (NVIDIA Corporation)\n\nThe Barnes-Hut approximation fo
 r N-body simulations reduces the time complexity of the naive all-pairs ap
 proach from O(N^2) to O(N log N) by hierarchically aggregating nearby part
 icles into single entities using a tree data structure. \nThis inherently 
 irregular algorithm poses substantial challenges for performance portable 
 implementations on multi-core CPUs and GPUs. \nWe introduce two portable f
 ully-parallel Barnes-Hut implementation strategies that trade-off differen
 t levels of GPU support for performance: an unbalanced concurrent octree, 
 and a balanced bounding volume hierarchy sorted by a Hilbert space-filling
  curve.\nWe implemente these algorithms in portable ISO C++ using parallel
  algorithms and concurrency primitives like atomics. \nThe results demonst
 rate competitive performance on a range of CPUs and GPUs. \nAdditionally, 
 they highlight the effectiveness of the par execution policy for highly co
 ncurrent irregular algorithms, outperforming par_unseq on CPUs and GPUs wi
 th Independent Forward Progress.\n\nTag: Graph Algorithms, Heterogeneous C
 omputing, Programming Frameworks and System Software\n\nRegistration Categ
 ory: Workshop Reg Pass\n\nSession Chairs: Michela Becchi (North Carolina S
 tate University); John Feo (Pacific Northwest National Laboratory (PNNL));
  Antonino Tumeo (Pacific Northwest National Laboratory (PNNL)); and Ana Lu
 cia Varbanescu (University of Twente, Netherlands; University of Amsterdam
 , Netherlands)\n\n
END:VEVENT
END:VCALENDAR
