{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T17:10:02Z","timestamp":1742317802633,"version":"3.40.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T00:00:00Z","timestamp":1326153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Grid Computing"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10723-011-9200-5","type":"journal-article","created":{"date-parts":[[2012,1,9]],"date-time":"2012-01-09T12:09:43Z","timestamp":1326110983000},"page":"211-235","source":"Crossref","is-referenced-by-count":6,"title":["A New Grid Scheduler with Failure Recovery and Rescheduling Mechanisms: Discussion and Analysis"],"prefix":"10.1007","volume":"10","author":[{"given":"Ahmed Ibrahim","family":"Saleh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amany M.","family":"Sarhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr M.","family":"Hamed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,10]]},"reference":[{"key":"9200_CR1","doi-asserted-by":"crossref","unstructured":"Yu, Z., Shi, W.: An adaptive rescheduling strategy for grid workflow applications. In: Parallel and Distributed Processing Symposium. IPDPS 2007. IEEE International, pp. 1\u201318 (2007)","DOI":"10.1109\/IPDPS.2007.370305"},{"key":"9200_CR2","unstructured":"Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Comput. Soc. Press (1996)"},{"issue":"8","key":"9200_CR3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/295685.298136","volume":"42","author":"D Lang","year":"1999","unstructured":"Lang, D., Oshima, M.: Seven good reasons for mobile agents. Commun. ACM 42(8), 88\u201389 (1999)","journal-title":"Commun. ACM"},{"issue":"4","key":"9200_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10723-006-9049-1","volume":"4","author":"R Aversa","year":"2006","unstructured":"Aversa, R., Di Martino, B., Mazzocca, N., Venticinque, S.: MAGDA: A mobile agent based grid architecture. J. Grid Computing 4(4), 395\u2013412 (2006)","journal-title":"J. Grid Computing"},{"issue":"8","key":"9200_CR5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1002\/cpe.982","volume":"18","author":"A Negri","year":"2006","unstructured":"Negri, A., Poggi, A., et al.: Dynamic grid tasks composition and distribution through agents. Concurr. Comput. Pract. Exp. 18(8), 875\u2013885 (2006)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"9200_CR6","doi-asserted-by":"crossref","unstructured":"Choi, S., Baik, M. et al.: Mobile agent based adaptive scheduling mechanism in peer-to-peer grid computing. In: Proc. of ICCSA 2005, pp. 936\u2013947. Singapore (2005)","DOI":"10.1007\/11424925_98"},{"key":"9200_CR7","doi-asserted-by":"crossref","unstructured":"Kontothanassis, L., Goddeau, D.: Profile driven scheduling for a heterogeneous server cluster. In: Proceedings of the 34th International Conference on Parallel Processing Workshops, pp. 336\u2013345 (2005)","DOI":"10.1109\/ICPPW.2005.73"},{"issue":"3","key":"9200_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jpdc.1999.1578","volume":"59","author":"Y Kwok","year":"1999","unstructured":"Kwok, Y., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. J. Parallel Distrib. Comput. 59(3), 381\u2013422 (1999)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9200_CR9","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"T Braun","year":"2001","unstructured":"Braun, T., Siegel, H., Beck, N.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61, 810\u2013837 (2001)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9200_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Koelbel, C., Kennedy, K.: Relative performance of scheduling algorithms in Grid Environments. In: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid, pp. 521\u2013528 (2007)","DOI":"10.1109\/CCGRID.2007.94"},{"issue":"13","key":"9200_CR11","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/71.993206","volume":"2","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S.: Performance effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 2(13), 260\u2013274 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"9200_CR12","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.jpdc.2005.01.006","volume":"65","author":"S Baskiyar","year":"2005","unstructured":"Baskiyar, S., Dickinson, C.: Scheduling directed acyclic task graphs on a bounded set of heterogeneous processors using task duplication. J. Parallel Distrib. Comput. 65(8), 911\u2013921 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9200_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-45209-6_28","volume-title":"Proc. of Euro-Par 2003, LNCS 2790","author":"H Zhao","year":"2003","unstructured":"Zhao, H., Sakellariou, R.: An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. In: Proc. of Euro-Par 2003, LNCS 2790, pp. 189\u2013194. Springer, Klagenfurt, Austria (2003)"},{"issue":"3","key":"9200_CR14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/1084805.1084816","volume":"34","author":"M Wieczorek","year":"2005","unstructured":"Wieczorek, M., Prodan, R., Fahringer, T.: Scheduling of scientific workflows in the ASKALON Grid environment. ACM SIGMOD Record 34(3), 56\u201362 (2005)","journal-title":"ACM SIGMOD Record"},{"key":"9200_CR15","doi-asserted-by":"crossref","unstructured":"Huang, C., Zheng, Y., Chen, D.: A scheduling approach with respect to overlap of computing and data transferring in grid computing. In: Proc. GCC (2), pp. 105\u2013112 (2003)","DOI":"10.1007\/978-3-540-24680-0_14"},{"key":"9200_CR16","doi-asserted-by":"crossref","unstructured":"Boutammine, S., Millot, D., Parrot, C.: An adaptive scheduling method for grid computing. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par, pp. 188\u2013197 (2006)","DOI":"10.1007\/11823285_20"},{"key":"9200_CR17","unstructured":"Silberschatz, A., Galvin, P., Gagne, G.: Process Scheduling. Operating System Concepts, 8th edn., p. 194. Wiley, Asia. ISBN 978\u20130\u201347023399\u20133. 5.3.4 Round Robin Scheduling (2010)"},{"key":"9200_CR18","doi-asserted-by":"crossref","unstructured":"Mandal, A, Kennedy, K., Koelbel, C., Marin, G., Johnsson, L.: Scheduling strategies for mapping application workflows onto the Grid. In: 14-th IEEE Symposium on High Performance Distributed Computing (HPDC14), pp. 125\u2013134 (2005)","DOI":"10.1109\/HPDC.2005.1520947"},{"key":"9200_CR19","unstructured":"Armstrong, R., Hensgen, D., Kidd, T.: The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In: 7th IEEE Heterogeneous Computing Workshop, pp. 79\u201387 (1998)"}],"container-title":["Journal of Grid Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-011-9200-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10723-011-9200-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-011-9200-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T16:32:15Z","timestamp":1742315535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10723-011-9200-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9200"],"URL":"https:\/\/doi.org\/10.1007\/s10723-011-9200-5","relation":{},"ISSN":["1570-7873","1572-9184"],"issn-type":[{"type":"print","value":"1570-7873"},{"type":"electronic","value":"1572-9184"}],"subject":[],"published":{"date-parts":[[2012,1,10]]}}}