Presentation
ACMP06 - Finding Optimistic Upper Bounds for Task Graph Throughput on Heterogeneous Systems Using Linear Programming
Presenter
DescriptionIn this extended abstract, 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 execution 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 solutions to such programs. Finally, we provide some brief examples of how such models can be used to describe the performance of existing task graph application, and how they can be used to guide the optimisation and development of future software.
TimeTuesday, June 410:07 - 10:07 CEST
LocationHG F 30 Audi Max
Session Chair
Event Type
Poster
