BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250822T115805Z
LOCATION:Room 5.0B15 & 16
DTSTART;TZID=Europe/Stockholm:20250617T120000
DTEND;TZID=Europe/Stockholm:20250617T123000
UID:submissions.pasc-conference.org_PASC25_sess130_msa134@linklings.com
SUMMARY:Reimagining Performance and Reproducibility in the Post-Moore Era:
  Innovations in Checkpointing and Workflow Management
DESCRIPTION:Michela Taufer (University of Tennessee)\n\nIn the post-Moore 
 era, the quest for enhanced performance and reproducibility is more critic
 al than ever. As researchers and engineers in high-performance computing (
 HPC) and scientific computing, reimagining key areas such as algorithms, h
 ardware architecture, and software is essential to drive progress. In this
  talk, we will explore how performance engineering is evolving, focusing o
 n checkpointing and the management of intermediate data in scientific work
 flows. We will first discuss the shift from traditional low-frequency chec
 kpointing techniques to modern high-frequency approaches that require comp
 lete histories and efficient memory use. By breaking data into chunks, usi
 ng hash functions to store only modified data, and leveraging Merkle-tree 
 structures, we improve efficiency, scalability, and GPU utilization while 
 addressing challenges like sparse data updates and limited I/O bandwidth. 
 We will also examine the balance between performance and data persistence 
 in workflows, where cloud infrastructures often sacrifice reproducibility 
 for speed. To overcome this, we propose a persistent, scalable architectur
 e that makes node-local data shareable across nodes. By rethinking checkpo
 inting and cloud data architectures, we show how innovations in algorithms
 , hardware, and software can significantly advance both performance and re
 producibility in the post-Moore era.\n\nDomain: Chemistry and Materials, C
 limate, Weather, and Earth Sciences, Applied Social Sciences and Humanitie
 s, Engineering, Life Sciences, Physics, Computational Methods and Applied 
 Mathematics\n\nSession Chairs: Irene Bonati (SURF), Ewa Deelman (Universit
 y of Southern California), and Sagar Dolas (SURF)\n\n
END:VEVENT
END:VCALENDAR
