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:20211207T055400Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20211118T083000
DTEND;TZID=America/Chicago:20211118T170000
UID:submissions.supercomputing.org_SC21_sess243_spostg103@linklings.com
SUMMARY:Analyzing Performance of File Aggregation in VELOC
DESCRIPTION:ACM Student Research Competition: Graduate Poster, ACM Student
  Research Competition: Undergraduate Poster, Posters\n\nAnalyzing Performa
 nce of File Aggregation in VELOC\n\nGossman\n\nAs High-Performance Computi
 ng (HPC) systems and applications continue to grow in size and complexity,
  the process of checkpointing to stable, external storage often results in
  I/O contention and degraded performance. Multi-level asynchronous checkpo
 inting strategies like VELOC (Very Low Overhead Checkpoint Strategy) have 
 begun gaining popularity among application scientists for their ability to
  leverage fast node-local storage and flush independently to stable storag
 e in the background. Currently, VELOC adopts a one-file-per-process flush 
 strategy; in large scientific applications, hundreds of thousands of files
  quickly overwhelm the network bandwidth, filesystem, and application scie
 ntists. Thus, applications need to condense the number of checkpoint files
  while preserving the I/O efficiency of asynchronous multi-level workflows
 . This work implements different aggregation strategies into VELOC's async
 hronous checkpoint runtime and analyzes the impact on performance.\n\nTag:
  In-Person Only\n\nRegistration Category: Tech Program Reg Pass, Exhibit H
 all Only
END:VEVENT
END:VCALENDAR