{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:57:57Z","timestamp":1754557077874},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642113215"},{"type":"electronic","value":"9783642113222"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11322-2_17","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T10:17:59Z","timestamp":1265710679000},"page":"142-154","source":"Crossref","is-referenced-by-count":5,"title":["Optimizing Distributed Computing Workflows in Heterogeneous Network Environments"],"prefix":"10.1007","author":[{"given":"Yi","family":"Gu","sequence":"first","affiliation":[]},{"given":"Qishi","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"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\u201342 (2007)","DOI":"10.1109\/E-SCIENCE.2007.3"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"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\u201374 (2005)","DOI":"10.1007\/11603771_7"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y. Kwok","year":"1999","unstructured":"Kwok, Y., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys\u00a031(4), 406\u2013471 (1999)","journal-title":"ACM Computing Surveys"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TPDS.2007.70726","volume":"19","author":"Y. Zhu","year":"2008","unstructured":"Zhu, Y., Li, B.: Overlay network with linear capacity constraints. IEEE Trans. on Parallel and Distributed Systems\u00a019, 159\u2013173 (2008)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1117\/12.642809"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-72584-8_78","volume-title":"Computational Science \u2013 ICCS 2007","author":"A. Benoit","year":"2007","unstructured":"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.\u00a04487, pp. 591\u2013598. Springer, Heidelberg (2007)"},{"key":"17_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of $\\textrm{NP}$ -completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of \n                    \n                      \n                    \n                    $\\textrm{NP}$\n                  -completeness. W.H. Freeman and Company, New York (1979)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010, 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","unstructured":"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)"},{"key":"17_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0040381","volume-title":"VLSI Algorithms and Architectures","author":"F. Afrati","year":"1988","unstructured":"Afrati, F., Papadimitriou, C., Papageorgiou, G.: Scheduling \n                    \n                      \n                    \n                    $\\textrm{DAG}$\n                  s to minimize time and communication. In: Reif, J.H. (ed.) AWOC 1988. LNCS, vol.\u00a0319, pp. 134\u2013138. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11322-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:35Z","timestamp":1606185575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11322-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642113215","9783642113222"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11322-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}