{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:12:27Z","timestamp":1766268747534},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76843-2_15","type":"book-chapter","created":{"date-parts":[[2007,11,21]],"date-time":"2007-11-21T01:07:44Z","timestamp":1195607264000},"page":"1331-1348","source":"Crossref","is-referenced-by-count":20,"title":["A Hybrid Algorithm for Scheduling Workflow Applications in Grid Environments (ICPDP)"],"prefix":"10.1007","author":[{"given":"Bogdan","family":"Simion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catalin","family":"Leordeanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Pop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Cristea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Muresan, O., Pop, F., Gorgan, D., Cristea, V.: Satellite Image Processing Applications in MedioGRID. In: ISPDC 2006 (2006)","DOI":"10.1109\/ISPDC.2006.42"},{"key":"15_CR2","unstructured":"Mandal, A., Dasgupta, A., Kennedy, K., Mazina, M., Koelbel, C., Marin, G., Cooper, K., Mellor-Crummey, J., Liu, B., Johnsson, L.: Cluster Computing and the Grid. In: CCGrid 2004, IEEE International Symposium (2004)"},{"key":"15_CR3","unstructured":"Walton, D.: The Simulation of Dynamic Resource Brokering in a Grid Environment, B.Comp.Sc., Department of Computer Science, The University of Adelaide, South Australia (November 2002)"},{"key":"15_CR4","volume-title":"The Grid: Blueprint for a New Computing Infrastructure","author":"I. Foster","year":"1999","unstructured":"Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International J. Supercomputer Applications (2001)","DOI":"10.1177\/109434200101500302"},{"key":"15_CR6","unstructured":"Dong, F., Akl, S.G.: Scheduling Algorithms for Grid Computing: State of the Art and Open Problems, Technical Report (2006)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"El-Rewini, H., Lewis, T.G.: Scheduling parallel programs onto arbitrary target machines. J. Parallel Distrib. Comput. (June 1990)","DOI":"10.1016\/0743-7315(90)90042-N"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Gerasoulis, A., Yang, T.: A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J. Parallel Distrib. Comput. (December 1992)","DOI":"10.1016\/0743-7315(92)90012-C"},{"issue":"2","key":"15_CR9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"O.H. Ibarra","year":"1977","unstructured":"Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. Assoc. Comput. Mach.\u00a024(2), 280\u2013289 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"11","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/32.41334","volume":"15","author":"D. Fernandez Baca","year":"1989","unstructured":"Fernandez Baca, D.: Allocating modules to processors in a distributed system. IEEE Trans. Software Engrg.\u00a015(11), 1427\u20131436 (1989)","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/TC.1985.1676563","volume":"34","author":"C.-C. Shen","year":"1985","unstructured":"Shen, C.-C., Tsai, W.-H.: A graph matching approach to optimal task assignment in distributed computing system using a minimax criterion. IEEE Trans. Comput.\u00a034(3), 197\u2013203 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Kwok, Y.K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys\u00a031(4) (December 1999)","DOI":"10.1145\/344588.344618"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Ullman, J.: NP-complete scheduling problems. J. Comput. System Sci.\u00a010 (1975)","DOI":"10.1016\/S0022-0000(75)80008-0"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/4434.708255","volume":"6","author":"M. Kafil","year":"1998","unstructured":"Kafil, M., Ahmad, I.: Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency\u00a06(3), 42\u201351 (1998)","journal-title":"IEEE Concurrency"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Adam, T.L., Chandy, K.M., Dickson, J.: A comparison of list scheduling for parallel processing systems. Comm. ACM\u00a017 (December 1974)","DOI":"10.1145\/361604.361619"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Ahmad, I., Kwok, Y.K.: On parallelizing the multiprocessor scheduling problem. IEEE Trans. Parallel Distrib. Systems\u00a011 (April 1999)","DOI":"10.1109\/71.762819"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Yang, T., Gerasoulis, A.: List scheduling with and without communication delays. Parallel Comput. (1993)","DOI":"10.1016\/0167-8191(93)90079-Z"},{"key":"15_CR18","unstructured":"MonALISA Web page (accessed on June 27, 2007), http:\/\/monalisa.cacr.caltech.edu"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Hwang, J.J., Chow, Y.C., Anger, F.D., Lee, C.Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput.\u00a018 (April 1999)","DOI":"10.1137\/0218016"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Wu, M.-Y., Gajski, D.D.: Hypercool: a programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Systems (July 1990)","DOI":"10.1109\/71.80160"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kwok, Y.-K., Ahmad: Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst.\u00a07 (1996)","DOI":"10.1109\/71.503776"},{"key":"15_CR22","unstructured":"Wu, M.-Y.: MCP revisited - Department of Electrical and Computer Engineering, The University of New Mexico"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Iordache, G.V., Boboila, M.S., Pop, F., Stratan, C., Cristea, V.: A Decentralized Strategy for Genetic Scheduling in Heterogeneous Environments. In: GADA 2006, Montpellier, France, November(2-3) (2006)","DOI":"10.1007\/11914952_13"},{"key":"15_CR24","volume-title":"Task Scheduling in Parallel and Distributed Systems","author":"H. El-Rewini","year":"1994","unstructured":"El-Rewini, H., Lewis, T., Ali, H.: Task Scheduling in Parallel and Distributed Systems. Prentice Hall, Englewood Cliffs (1994)"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Waldo: The Jini architecture for network-centric computing. Communications of the ACM (July 1999)","DOI":"10.1145\/306549.306582"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Gupta, R., Talwar, S., Agrawal, D.P.: Jini Home Networking: A Step toward Pervasive Computing. Computer, 34\u201340 (August 2002)","DOI":"10.1109\/MC.2002.1023786"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Venugopal, S., Buyya, R., Winton, L.: A Grid Service Broker for Scheduling Distributed Data-Oriented Applications on Global Grids. In: ACM International Conference Proceeding Series, vol.\u00a076, pp. 75\u201380 (2004)","DOI":"10.1145\/1028493.1028506"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76843-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:41:32Z","timestamp":1619520092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76843-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540768357"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76843-2_15","relation":{},"subject":[]}}