{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:37:53Z","timestamp":1725619073777},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642240126"},{"type":"electronic","value":"9783642240133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24013-3_12","type":"book-chapter","created":{"date-parts":[[2011,10,7]],"date-time":"2011-10-07T04:52:11Z","timestamp":1317963131000},"page":"117-127","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Mapping and Scheduling Algorithm for Distributed Workflow Applications in a Heterogeneous Computing Environment"],"prefix":"10.1007","author":[{"given":"Mengxia","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Mi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Kwok, Y., Ahmad, I.: Dynamic critical-path scheduling: An effective technique for allocating task graph to multiprocessors. IEEE Trans. on Parallel and Distributed Systems\u00a07(5) (May 1996)","DOI":"10.1109\/71.503776"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Wu, Q., Gu, Y.: Supporting distributed application workflows in heterogeneous computing environments. In: Proc. of the 14th IEEE Int. Conf. on Parallel and Distributed Systems, Melbourne, Australia, pp. 3\u201310 (December 2008)","DOI":"10.1109\/ICPADS.2008.40"},{"key":"12_CR3","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"},{"key":"12_CR4","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"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"M.Y. Wu","year":"1990","unstructured":"Wu, M.Y., Gajski, D.D.: Hypertool: A programming aid for message-passing systems. IEEE Trans. on Parallel and Distributed Systems\u00a01(3), 330\u2013343 (1990)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"12_CR6","first-page":"175","volume":"4","author":"L. Wang","year":"1997","unstructured":"Wang, L., Siegel, H.J., Roychowdhury, V.P., Maciejewski, A.A.: Task matching and scheduling in heterogeneous computing environment using a genetic-algorithm-based approach. Journal Parallel and Distributed Computing\u00a04, 175\u2013187 (1997)","journal-title":"Journal Parallel and Distributed Computing"},{"issue":"3-4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0020-0255(97)10012-3","volume":"106","author":"B.R. Carter","year":"1998","unstructured":"Carter, B.R., Watson, D.W., Freund, R.F., Keith, E., Mirabile, F., Siegel, H.J.: Generational scheduling for dynamic task management in heterogeneous computing systems. Information Science\u00a0106(3-4), 219\u2013236 (1998)","journal-title":"Information Science"},{"key":"12_CR8","unstructured":"Ma, T., Buyya, R.: Critical-path and priority based algorithms for scheduling workflows with parameter sweep tasks on global grids. In: Proc. of the 17th Int. Symp. on Computer Architecture on High Performance Computing, pp. 251\u2013258 (2005)"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y.K. Kwok","year":"1999","unstructured":"Kwok, Y.K., 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":"12_CR10","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0040381","volume-title":"Proc. of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures","author":"F.N. Afrati","year":"1988","unstructured":"Afrati, F.N., Papadimitriou, C.H., Papageorgiou, G.: Scheduling dags to minimize time and communication. In: Proc. of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, pp. 134\u2013138. Springer, Heidelberg (1988)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.: Performance effective and lowcomplexity task scheduling for heterogeneous computing. IEEE Trans. on Parallel and Distributed Systems\u00a013(3) (2002)","DOI":"10.1109\/71.993206"},{"key":"12_CR12","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: Proc. of the 3rd IAPR-TC-15 Int. Workshop on Graph-based Representations, Italy (2001)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Rahman, M., Venugopal, S., Buyya, R.: Ant colony system: 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":"12_CR14","doi-asserted-by":"crossref","unstructured":"Boeres, C., Filho, J., Rebello, V.: A cluster-based strategy for scheduling task on heterogeneous processors. In: in Proc. of 16th Symp. on Computer Architecture and High Performance Computing, pp. 214\u2013221 (2004)","DOI":"10.1109\/SBAC-PAD.2004.1"},{"key":"12_CR15","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: 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":"12_CR16","unstructured":"Wu, Q., Gu, Y., Lin, Y., Rao, N.S.V.: Latency Modeling and Minimization for Large-scale Scientific Workflows in Distributed Network Environments. In: Proc. of the 44th Annual Simulation Symposium (ANSS 2011), Boston, MA, USA, April 4-7 (2011)"},{"key":"12_CR17","unstructured":"Zhu, M., Wu, Q., Rao, N.S.V., Iyengar, S.S.: Adaptive visualization pipeline decomposition and mapping onto computer networks. In: Proc. of the IEEE Internatioal Conference on Image and Graphics, Hong Kong, China, December 18-20, pp. 402\u2013405 (2004)"}],"container-title":["Studies in Computational Intelligence","Intelligent Distributed Computing V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24013-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:15:15Z","timestamp":1606187715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24013-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240126","9783642240133"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24013-3_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2011]]}}}