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:20230124T171527Z
LOCATION:C143-149
DTSTART;TZID=America/Chicago:20221114T112500
DTEND;TZID=America/Chicago:20221114T114500
UID:submissions.supercomputing.org_SC22_sess439_ws_scsc107@linklings.com
SUMMARY:Emergency Backup for Scientific Applications
DESCRIPTION:Workshop\n\nEmergency Backup for Scientific Applications\n\nEs
 posito, Haine, Mohammed\n\nA framework for the efficient in-network data t
 ransfer between a parallel application and an independent storage server i
 s proposed. The case of an unexpected and unrecoverable interruption of th
 e application is considered, where the server takes the role of an emergen
 cy backup service preventing the unnecessary loss of valuable information.
  Cleanup time buffers can be optimally exploited by the framework making u
 se of RDMA transport and redistribution of data by means of the Maestro mi
 ddleware. Experiments are performed on a HPE/Cray EX system to construct a
  heuristics for amounts of data that can realistically be backed up during
  a given time buffer. The method proves to be faster than VELOC and plain 
 MPI-IO using one server node already, for a number of user ranks up to a h
 undred, with the promise of also better scalability in the long run due to
  the in-network approach as opposed to filesystem transport.\n\nSession Fo
 rmat: Recorded\n\nTag: Reliability and Resiliency\n\nRegistration Category
 : Workshop Reg Pass
END:VEVENT
END:VCALENDAR