Abstract
Next-generation computation-intensive applications in various science and engineering fields feature large-scale computing workflows. Supporting such computing workflows and optimizing their network performance in terms of end-to-end delay or frame rate in heterogeneous network environments are critical to the success of these distributed applications that require fast response time or smooth data flow. We formulate six linear pipeline configuration problems with different mapping objectives and network constraints, and one general workflow mapping problem. We investigate the computational complexity of these problems and design optimal or heuristic algorithms with rigorous correctness proof and performance analysis. An extensive set of optimization experiments on a large number of simulated workflows and networks illustrate the superior performance of the proposed algorithms in comparison with that of existing methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rahman, M., Venugopal, S., Buyya, R.: A dynamic critical path algorithm for scheduling scientific workflow applications on global grids. In: Proc. of the 3rd IEEE Int. Conf. on e-Science and Grid Computing, pp. 35–42 (2007)
Sekhar, A., Manoj, B., Murthy, C.: A state-space search approach for optimizing reliability and cost of execution in distributed sensor networks. In: Proc. of Int. Workshop on Distributed Computing, pp. 63–74 (2005)
Kwok, Y., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys 31(4), 406–471 (1999)
Zhu, Y., Li, B.: Overlay network with linear capacity constraints. IEEE Trans. on Parallel and Distributed Systems 19, 159–173 (2008)
Agarwalla, B., Ahmed, N., Hilley, D., Ramachandran, U.: Streamline: a scheduling heuristic for streaming application on the grid. In: The 13th Multimedia Computing and Networking Conf., San Jose, CA (2006)
Benoit, A., Robert, Y.: Mapping pipeline skeletons onto heterogeneous platforms. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 591–598. Springer, Heidelberg (2007)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of \(\textrm{NP}\)-completeness. W.H. Freeman and Company, New York (1979)
Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10, 111–121 (1980)
Wu, Q., Zhu, M., Gu, Y., Rao, N.: System design and algorithmic development for computational steering in distributed environments. IEEE Trans. on Parallel and Distributed Systems 99(1) (May 2009)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
Afrati, F., Papadimitriou, C., Papageorgiou, G.: Scheduling \(\textrm{DAG}\)s to minimize time and communication. In: Reif, J.H. (ed.) AWOC 1988. LNCS, vol. 319, pp. 134–138. Springer, Heidelberg (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gu, Y., Wu, Q. (2010). Optimizing Distributed Computing Workflows in Heterogeneous Network Environments. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)