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:D221
DTSTART;TZID=America/Chicago:20221113T155500
DTEND;TZID=America/Chicago:20221113T162000
UID:submissions.supercomputing.org_SC22_sess435_ws_ross104@linklings.com
SUMMARY:Sequential Task Flow Runtime Model Improvements and Limitations
DESCRIPTION:Workshop\n\nSequential Task Flow Runtime Model Improvements an
 d Limitations\n\nPei, Bosilca, Dongarra\n\nThe sequential task flow (STF) 
 model is the mainstream approach for interacting with task-based runtime s
 ystems.  Compared with other approaches of submitting tasks into a runtime
  system, STF has interesting advantages centered around an easy-to-use API
 , that allows users to expressed algorithms as a sequence of tasks, while 
 allowing the runtime to automatically identify and analyze the task depend
 encies and scheduling.\n\nWe focus on the DTD interface in PaRSEC, highlig
 ht some of its lesser known limitations and implemented two optimization t
 echniques for DTD: support for user level graph trimming, and a new API fo
 r broadcast read-only data to remote tasks.  We then analyze the benefits 
 and limitations of these optimizations with benchmarks as well as on Chole
 sky and QR matrix factorizations, on two different systems Shaheen-II and 
 Fugaku. We pointed out some potential for further improvements, and provid
 ed valuable insights into the strength and weakness of STF model.\n\nSessi
 on Format: Recorded\n\nTag: Runtime Systems, System Software\n\nRegistrati
 on Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR