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:20260522T150110Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess323_post114@linklings.com
SUMMARY:The NAStJA Framework: Non-Collective Scalable Global Communication
 s
DESCRIPTION:Marco Berghoff and Ivan Kondov (Karlsruhe Institute of Technol
 ogy)\n\nIn recent years, simulations in various areas of science and engin
 eering have proven to be very useful.  To efficiently deploy simulation co
 des on current and future high-performance computer systems, high node lev
 el performance, scalable communication and the exclusion of unnecessary ca
 lculations are an absolute must when developing new solvers.\n\nWe have in
 troduced the NAStJA framework, a block-based MPI parallel solver for algor
 ithms, based on regular grid methods, i.e., stencil codes.  NAStJA has a d
 ynamic block adaptation, which modifies the calculation domain around the 
 region in which the calculation is currently taking place.  The creation a
 nd deletion of blocks are autonomously managed within local neighborhoods.
   Collective all-gather communication is avoided by using a multi-hop netw
 ork to distribute information across the entire domain that greatly improv
 es the application scaling.  In this contribution, we present applications
  that can benefit from this adaptive method and scaling tests demonstratin
 g the excellent scalability.\n\nRegistration Category: Tech Program Reg Pa
 ss, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR