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:20260422T000605Z
LOCATION:DEF Concourse
DTSTART;TZID=America/Denver:20231116T100000
DTEND;TZID=America/Denver:20231116T170000
UID:submissions.supercomputing.org_SC23_sess300_spostu120@linklings.com
SUMMARY:Dynamic and First-Class Priorities
DESCRIPTION:Marelle León (Illinois Institute of Technology)\n\nInteractive
  parallel programs have varying responsiveness requirements for tasks of d
 iffering urgency, which has been met with the solution of thread prioritie
 s to determine the tasks' allocation of processor time. Previous priority-
 based language models limit the span of entire threads to a single priorit
 y. Given an approaching real-time deadline, tasks are unable to shift to a
  higher priority in order to match the changing requirements. We design a 
 type system that enforces thread priorities and allows dynamic prioritizat
 ion, treating priorities as first-class to reduce code complexity. We crea
 te a dependency graph-based cost model for our system and define strong we
 ll-formedness to exclude unwanted priority inversions. We then prove that 
 programs under our type system produce strongly well-formed graphs.\n\nReg
 istration Category: Tech Program Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR