Abstract
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 processor setup time occurs when passing from one stage to another. In this paper, 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 platforms 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.: A survey of scheduling problems with setup times or costs. European J. of Op. Research 187(3), 985–1032 (2008)
Allahverdi, A., Soroush, H.: The significance of reducing setup times/setup costs. European Journal of Operational Research 187(3), 978–984 (2008)
Benoit, A., Coqblin, M., Nicod, J.M., Philippe, L., Rehn-Sonigo, V.: Throughput optimization for pipeline workflow scheduling with setup times. Research Report 7886, INRIA (2012), http://graal.ens-lyon.fr/~abenoit/papers/RR-7886.pdf
Benoit, A., Robert, Y.: Mapping pipeline skeletons onto heterogeneous platforms. J. Parallel and Distributed Computing 68(6), 790–808 (2008)
Bhat, P., Raghavendra, C., Prasanna, V.: Efficient collective communication in distributed heterogeneous systems. In: 19th ICDCS 1999, pp. 15–24 (1999)
Bhat, P., Raghavendra, C., Prasanna, V.: Efficient collective communication in distributed heterogeneous systems. JPDC 63, 251–263 (2003)
Norman, B.A.: Norman: Scheduling flowshops with finite buffers and sequence-dependent setup times. Comp. & Indus. Engineering 36(1), 163–177 (1999)
Gendreau, D., Gauthier, M., Hériban, D., Lutz, P.: Modular architecture of the microfactories for automatic micro-assembly. Journal of Robotics and Computer Integrated Manufacturing 26(4), 354–360 (2010)
Li, L., Qiao, F.: Aco-based scheduling for a single batch processing machine in semiconductor manufacturing. In: IEEE Int. CASE 2008, pp. 85–90 (2008)
Li, L., Qiao, F., Wu, Q.: Aco-based scheduling of parallel batch processing machines to minimize the total weighted tardiness. In: Int. CASE 2009, pp. 280–285 (2009)
Luh, P.B., Gou, L., Zhang, Y., Nagahora, T., Tsuji, M., Yoneda, K., Hasegawa, T., Kyoya, Y., Kano, T.: Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annals of Operations Research 76, 233–259 (1998)
Srikar, B., Ghosh, S.: A milp model for the n-job, m-stage flowshop with sequence dependent set-up times. Int. J. of Production Research 24(6), 1459–1474 (1986)
Subhlok, J., Vondran, G.: Optimal mapping of sequences of data parallel tasks. ACM SIGPLAN Notices 30(8), 134–143 (1995)
Subhlok, J., Vondran, G.: Optimal latency-throughput tradeoffs for data parallel pipelines. In: Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, p. 71. ACM (1996)
Zhang, M., Goldberg, K.: Calibration of wafer handling robots: A fixturing approach. In: IEEE Int. CASE 2007, pp. 255–260 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benoit, A., Coqblin, M., Nicod, JM., Philippe, L., Rehn-Sonigo, V. (2013). Throughput Optimization for Pipeline Workflow Scheduling with Setup Times. In: Caragiannis, I., et al. Euro-Par 2012: Parallel Processing Workshops. Euro-Par 2012. Lecture Notes in Computer Science, vol 7640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36949-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-36949-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36948-3
Online ISBN: 978-3-642-36949-0
eBook Packages: Computer ScienceComputer Science (R0)