Coauthors: Anne Benoit, Jean-Marc Nicod, Laurent Philippe, and Veronika Rehn-Sonigo

We tackle pipeline workflow applications that are executed on a distributed platform with setup times. Several computation stages are interconnected as a linear application graph, and each stage holds a buffer of limited size where intermediate results are stored and a proces- sor setup time occurs when passing from one stage to another. In this pa- per, we focus on interval mappings (consecutive stages mapped on a same processor), and the objective is the throughput optimization. Even when neglecting setup times, the problem is NP-hard on heterogeneous plat- forms and we therefore restrict to homogeneous resources. We provide an optimal algorithm for constellations with identical buffer capacities. When buffer sizes are not fixed, we deal with the problem of allocating the buffers in shared memory and present a b/(b + 1)-approximation algorithm.