BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000712Z
LOCATION:702
DTSTART;TZID=America/Denver:20231113T140000
DTEND;TZID=America/Denver:20231113T150000
UID:submissions.supercomputing.org_SC23_sess449_misc142@linklings.com
SUMMARY:PAW-ATM Distinguished Speaker:  Ethan Gutmann – National Center fo
 r Atmospheric Research: Trials and Tribulations and Joys of Developing wit
 h Alternative Parallel Frameworks
DESCRIPTION:Ethan Gutmann (National Center for Atmospheric Research (NCAR)
 )\n\nDeveloping large scientific applications is challenging for many reas
 ons, and alternative programming can help with better support for the impl
 ementation.  These applications need to incorporate the latest domain spec
 ific scientific information, be applicable to real world problems, and be 
 robust across a wide variety of inputs.  For many models, parallelization 
 is only seen as a necessary hardship, and once developed, the parallelizat
 ion logic is left untouched, sometimes for decades.  Alternative parallel 
 application programming implementations such as Coarray Fortran, Chapel, o
 r UPC++ promise to make implementing and maintaining such parallel logic e
 asier; however, the alternative nature of these implementations often mean
 s they do not have the support in the operational HPC community to make th
 at dream a reality. Here we discuss some of the problems that arise implem
 enting the parallelization logic for two different models in Coarray Fortr
 an. We highlight an example from the Intermediate Complexity Atmospheric R
 esearch model (ICAR) in which the Partitioned Global Address Space (PGAS) 
 programming model of Coarray Fortran made implementing the generation of a
  massive lookup-table in parallel almost trivial.  We then discuss issues 
 that have arisen since the initial implementation due to inconsistencies i
 n compiler implementations. Improving the support for such parallel framew
 orks is a bit of a chicken-and-egg problem.  Compiler writers do not wish 
 to devote resources to features that are not widely used, and developers d
 o not want to use features without robust support.\n\nTag: Accelerators, A
 rtificial Intelligence/Machine Learning, Algorithms, Applications, Archite
 cture and Networks, Distributed Computing, Compilers, Data Analysis, Visua
 lization, and Storage, Exascale, Heterogeneous Computing, Linear Algebra, 
 Message Passing, Performance Optimization, Programming Frameworks and Syst
 em Software, Quantum Computing, Runtime Systems, Software Engineering, Sus
 tainability, Task Parallelism, Tensors\n\nRegistration Category: Workshop 
 Reg Pass\n\nSession Chairs: Engin Kayraklioglu (Hewlett Packard Enterprise
  (HPE)), Daniele Lezzi (Barcelona Supercomputing Center (BSC)), Bill Long 
 (Retired), Karla Vanessa Morris Wright (Sandia National Laboratories), Ire
 ne Moulitsas (Cranfield University), and Elliott Slaughter (SLAC National 
 Accelerator Laboratory)\n\n
END:VEVENT
END:VCALENDAR