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:20260522T150111Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181115T083000
DTEND;TZID=America/Chicago:20181115T170000
UID:submissions.supercomputing.org_SC18_sess324_post136@linklings.com
SUMMARY:Massively Parallel Stress Chain Characterization for Billion Parti
 cle DEM Simulation of Accretionary Prism Formation
DESCRIPTION:Mikito Furuichi, Daisuke Nishiura, and Takane Hori (Japan Agen
 cy for Marine-Earth Science and Technology)\n\nHerein, a novel algorithm f
 or characterizing stress chains using a large parallel computer system is 
 presented. Stress chains are important for analyzing the results of large-
 scale discrete element method (DEM) simulations. However, the general algo
 rithm is difficult to parallelize especially when selecting networks longe
 r than several particles. Therefore, we propose a new parallel algorithm t
 o count the number of particles that are tightly connected, based on itera
 tive operations with nearest-neighbor computations and communications. The
  new algorithm is examined via a real-scale numerical sandbox experiment u
 sing 2.4 billion particles. We successfully compute the stress chains with
  a reasonable computational cost comparable to the single-step DEM computa
 tion time. The visualization of the stress chains from the large-scale DEM
  simulation result reveals the existence of arcuate stress structures that
  may control accretionary prism formation, which is an important scientifi
 c discovery.\n\nRegistration Category: Tech Program Reg Pass, Exhibits Reg
  Pass\n\n
END:VEVENT
END:VCALENDAR
