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:20241120T082410Z
LOCATION:HG F 30 Audi Max
DTSTART;TZID=Europe/Stockholm:20240604T100700
DTEND;TZID=Europe/Stockholm:20240604T100700
UID:submissions.pasc-conference.org_PASC24_sess158_posC110@linklings.com
SUMMARY:ACMP06 - Finding Optimistic Upper Bounds for Task Graph Throughput
  on Heterogeneous Systems Using Linear Programming
DESCRIPTION:Poster\n\nStephen Nicholas Swatman (University of Amsterdam, C
 ERN) and Ana-Lucia Varbanescu (University of Twente)\n\nIn this extended a
 bstract, we present a model -- inspired by previous work in the data flow 
 community -- for finding optimistic upper bounds on the throughput of task
  graphs executed on heterogeneous systems. This model interprets the execu
 tion of such graphs as flow networks with additional resource constraints.
  We show that such flow networks can be optimised as linear programs, and 
 we present a Python interface for the representation and the finding of so
 lutions to such programs. Finally, we provide some brief examples of how s
 uch models can be used to describe the performance of existing task graph 
 application, and how they can be used to guide the optimisation and develo
 pment of future software.\n\nSession Chair: Iva Kavcic (Met Office)
END:VEVENT
END:VCALENDAR