{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T18:10:15Z","timestamp":1740247815076,"version":"3.37.3"},"publisher-location":"Boston, MA","reference-count":29,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441967930"},{"type":"electronic","value":"9781441967947"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-4419-6794-7_10","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T17:27:20Z","timestamp":1278437240000},"page":"119-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Mapping Workflows on Grid Resources: Experiments with the Montage Workflow"],"prefix":"10.1007","author":[{"given":"Rizos","family":"Sakellariou","sequence":"first","affiliation":[]},{"given":"Henan","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Ewa","family":"Deelman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"J. Annis, Y. Zhao, J. Voeckler, M. Wilde, S. Kent, and I. Foster. Applying Chimera virtual data concepts to cluster finding in the Sloan Sky Survey. In: Supercomputing\u201902: Proceedings of the 2002 ACM\/IEEE Conference on Supercomputing, Los Alamitos, CA, USA, IEEE Computer Scciety Press, 2002, pp. 1-14.","DOI":"10.1109\/SC.2002.10021"},{"key":"10_CR2","unstructured":"G. B. Berilman, J. C. Good, A. C. Laity, et at. Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory. In Astronomical Data Analysis Software & Systems ADASS) XIII, 2003."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"5. Bhamthi, A. Chervenak, E. Deelman, G. Mehta, M.-H. Su, and K. Vahi. Characterization of Scientific Workflows. In Proceedings of the 3rd Workshop on Wor4flows in Support of Large- Scale Science (WORKS 2008), November 2008.","DOI":"10.1109\/WORKS.2008.4723958"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"J. Blythe, S. Jam, E. Deelman, Y. Gil, K. Vahi, A. Mandal, and K. Kennedy. Task Scheduling Strategies for Workflow-based Applications in Grids. In IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2005), 2005.","DOI":"10.1109\/CCGRID.2005.1558639"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"T. D. Bmun, H.J. Siegel, N. Beck, L. L. Boloni, M. Maheswaran,A. I. Reuther,J. P. Robertson, M. D. Theys, and B. Yao. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, vol. 61, pp. 810-837, 2001.","DOI":"10.1006\/jpdc.2000.1714"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"L. Breslau, D. Estrin, K. Fall, S. Floyd, J. Heidemann, A. Helmy, P. Huang, S. McCanne, K. Varadhan, Y. Xu, and H. Yu. Advances in network simulation. Computer, vol.33(5), pp.S9- 67, May 2000. See also http:\/\/www.isi.edu\/nsnamlns.","DOI":"10.1109\/2.841785"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"L.-C. Canon, E. Jeannot, R. Sakellariou, and W. Zheng. Comparative evaluation of the Robustness of DAG Scheduling Heuristics. In Grid Computing: Achievements and Prospects (eds: S. Gorlatch, P. Fragopoulou, T. Priol), Spffnger, 2008, pp. 73-84. An extended version is available as CoreGRID Technical Report TR-0120, December 2007.","DOI":"10.1007\/978-0-387-09457-1_7"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for scheduling parameter sweep applications in Gild environments. In Proceedings of the 9th Heterogeneous Computing Works lwp (HCW\u2019OO), 2000, pp. 349-363.","DOI":"10.1109\/HCW.2000.843757"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.future.2008.06.012","volume":"25","author":"E. Deelman","year":"2009","unstructured":"E. Deelman, D. Gannon, M. Shields, and I. Taylor. Workflows and c-Science: An overview of workflow system features and capabilities. Future Generation Computer Systems, 25, 2009, pp. 528-540.","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"10_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1155\/2005\/128026","volume":"13","author":"E. Deelman","year":"2005","unstructured":"E. Deelman, G. Singh, M. H. Su,J. Blythe,Y. Gi1,C. Kesselman, G. Mehta, K. Vahi, G. B. Berilman, J. Good, A. Laity, J. C. Jacob, and D. S. Katz. Pegasus: A framework for mapping complex scientific workflows onto distributed systems. Scientific Programning, 13(3), 2005, pp. 219-237.","journal-title":"Scientific Programning"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"E Dong and S. G. Aid. PFAS: A Resource-Performance-Fluctuation-Aware Workflow Scheduling Aigorithm for Gild Computing. In Proceedings of IPDPS 2007, 2007.","DOI":"10.1109\/IPDPS.2007.370328"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"R. Huang, H. Casanova, and A. A. Chien. Using Virtual Grids to Simplify Application Scheduling. In Proceedings of IPDPS 2006, 2006.","DOI":"10.1109\/IPDPS.2006.1639309"},{"issue":"4","key":"10_CR13","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y.-K. Kwok","year":"1999","unstructured":"Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4), December 1999, pp. 406-471.","journal-title":"ACM Computing Surveys"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"K. Lee, N. W. Paton, R. Sakella\u00f1ou, E. Deelman, A. A. A. Fernandes, and G. Mehta. Adaptive Workflow Processing and Execution in Pegasus. In 3rd International Workshop on Wor4flow Management and Applications in Grid Environments (WaGeO8) (in Proceedings of the Third International Conference on Grid and Pervasive Computing Symposia\/Workshops, May 25-28 2008, Kunrning, China), 2008, pp. 99106.","DOI":"10.1109\/GPC.WORKSHOPS.2008.30"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"M. M. Lopez, E. Heymann, and M. A. Senar. Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems. In Proceedings of the 5th International Symposium on Parallel and Distributed Computing (ISPDC), 2006, pp. 199-207.","DOI":"10.1109\/ISPDC.2006.9"},{"key":"10_CR16","unstructured":"A. Mandal, K. Kennedy, C. Koelbel, G. Mann, J. Mellor-Crunimey, B. Liu, and L. Johnsson. Scheduling Strategies for Mapping Application Workflows onto the Grid. In IEEE International Symposium on High Performance Distributed Computing (HPDC 2005), 2005."},{"key":"10_CR17","unstructured":"Montage. An Astronomical Image Mosaic Engine. http:\/\/montage.ipac.caltech.edu\/"},{"key":"10_CR18","unstructured":"M. L. Pinedo. Scheduling: Theory, Algorithms, and Systems. Springer, 2008."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"A. Ramakrishnan, G. Singh, H. Zhao, E. Deehrnin, R. Sakellariou, K. Vahi, K. Blackburn, D. Meyers, and M. Sainidi. Scheduling Data-Intensive Workflows onto Stomge-Constrained Distributed Resources. In Proceedings of the 7th IEEE International Symposium on Cluster Computing and the Grid (CCGrid\u201907), 2007, pp. 401-409.","DOI":"10.1109\/CCGRID.2007.101"},{"key":"10_CR20","unstructured":"R. Sakellariou and H. Zhao. A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In Proceedings of the 13th Heterogeneous Computing Workshop (HCW\u201904), Santa Fe, New Mexico, USA, on April 26, 2004."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"R. Sakellariou and H. Zhao. A low-cost rescheduling policy for efficient mapping of work- flows on grid systems. Scientific Programming, 12(4), December 2004.","DOI":"10.1155\/2004\/930924"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"I. J. Taylor, E. Deelman, D. B. Gannon, and M. Schields. Workfiows for c-Science. Scientific Wor4flows for Gridy. Springer, 2007.","DOI":"10.1007\/978-1-84628-757-2"},{"issue":"3","key":"10_CR23","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H. Topcuoglu","year":"2002","unstructured":"H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3), Maich 2002, pp. 260-274.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"M. Wieczorek, R. Pmdan, and T. Fahringer. Scheduling of Scientific Workflows in the ASKALON Grid Environment. In SIGMOD Record, volume 34(3), September 2005.","DOI":"10.1145\/1084805.1084816"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"M. Wieczorek, R. Prodan, and T. Fahffngen Comparison of Workflow Scheduling Stmtegies on the Grid. In Proceedings of the Second Grid Resource Management Workshop (GRMW\u20192005), Spffnger, LNCS 3911,2006, pp.792-800.","DOI":"10.1007\/11752578_95"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"J. Yu and R. Buyya. A Taxonomy of Scientific Workflow Systems for Gild Computing. In SIGMOD Record, volume 34(3), September 2005.","DOI":"10.1145\/1084805.1084814"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"J. Yu, R. Buyya, and K. Ramamohanamo. Workflow Scheduling Algorithms for Grid Computing. In Studies in Computational Intelligence, volume 146, Springer, 2008, pp. 173-214.","DOI":"10.1007\/978-3-540-69277-5_7"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"H. Zhao and R. Sakellariou. An experimental investigation into the rankfunction of the heterogeneous earliest finish time scheduling algoffthm. In Euro-Par 2003, Spffnger-Verlag, LNCS 2790,2003.","DOI":"10.1007\/978-3-540-45209-6_28"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Y. Zhao, J. Dobson, I. Foster, L. Moreau, and M. Wilde. A notation and system for expressing and executing cleanly typed workflows on messy scientific data. In SIGMOD Record, volume 34(3), September 2005, pp. 37-43.","DOI":"10.1145\/1084805.1084813"}],"container-title":["Grids, P2P and Services Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-6794-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T17:28:01Z","timestamp":1740245281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-6794-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781441967930","9781441967947"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-6794-7_10","relation":{},"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"7 July 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}