BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150127Z
LOCATION:Exhibit Hall B
DTSTART;TZID=America/Chicago:20181113T133000
DTEND;TZID=America/Chicago:20181113T150000
UID:submissions.supercomputing.org_SC18_sess495_inv113@linklings.com
SUMMARY:The Parallel Hashed Oct-Tree Algorithm Revisited
DESCRIPTION:Mike Warren (Descartes Labs Inc) and John Salmon (D.E. Shaw Re
 search)\n\nAlgorithms such as fast N-body methods, coupled with the extrao
 rdinary increase in computational power over the past three decades, have 
 played a major part in the process of understanding complex physical syste
 ms.  In this talk, we provide some context and history of gravitational N-
 body simulations and discuss the evolution of the parallel hashed oct-tree
  N-body algorithm and the problems it has been applied to over the years s
 ince its publication.  We touch on concurrent evolution in hardware, such 
 as Beowulf clusters and the Cloud as well as physical applications in cosm
 ology, galaxy formation, supernovae,  hydrodynamics and planet formation.\
 n\nRegistration Category: Tech Program Reg Pass\n\nSession Chair: Mary Hal
 l (University of Utah)\n\n
END:VEVENT
END:VCALENDAR