{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:28:42Z","timestamp":1742390922663,"version":"3.33.0"},"reference-count":56,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p> Service Level Agreements (SLAs) are currently one of the major research topics in grid computing. Among many system components for SLA-related grid jobs, the SLA mapping mechanism has received widespread attention. It is responsible for assigning sub-jobs of a workflow to a variety of grid resources in a way that meets the user's deadline and costs as little as possible. With the distinguished workload and resource characteristics, mapping a heavy communication workflow within an SLA context gives rise to a complicated combinatorial optimization problem. This paper presents the application of various metaheuristics and suggests a possible approach to solving this problem. Performance measurements deliver evaluation results on the quality and efficiency of each method. <\/jats:p>","DOI":"10.1177\/1094342007086230","type":"journal-article","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T13:52:56Z","timestamp":1218549176000},"page":"330-346","source":"Crossref","is-referenced-by-count":11,"title":["Mapping Heavy Communication Grid-Based Workflows Onto Grid Resources Within                 an SLA Context Using Metaheuristics"],"prefix":"10.1177","volume":"22","author":[{"given":"Dang Minh","family":"Quan","sequence":"first","affiliation":[{"name":"SCHOOL OF INFORMATION TECHNOLOGY, INTERNATIONAL UNIVERSITY IN GERMANY,\r                        76646 BRUCHSAL, GERMANY,"}]},{"given":"D. Frank","family":"Hsu","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF COMPUTER & INFORMATION SCIENCES, FORDHAM UNIVERSITY, 113 WEST 60TH STREET, NEW YORK, NY USA"}]}],"member":"179","published-online":{"date-parts":[[2008,8,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1145\/361604.361619"},{"key":"atypb2","first-page":"134","volume":"13","author":"Berriman, G.B.","year":"2003","journal-title":"ADASS"},{"volume-title":"Proceedings of e-Science 2005","author":"Brandic, I.","key":"atypb3"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24804-0"},{"volume-title":"Proceedings of the IEEE CCGrid 2004","author":"Burchard, L.","key":"atypb5"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2004.09.032"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1088"},{"volume-title":"Proceedings of the 4th International Conference on Business Process Management(BPM2006)","author":"Chen, J.","key":"atypb8"},{"volume-title":"Computer and Job-Shop Scheduling Theory","year":"1976","author":"Coffman, E.G.","key":"atypb9"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.4.680"},{"volume-title":"Proceedings of the 2nd European Across Grids Conference","author":"Deelman, E.","key":"atypb11"},{"key":"atypb12","unstructured":"Dorigo, M.\n                 and \n                    Di Caro, G.\n                 (1999). The ant colony optimization meta-heuristic, New Ideas\n                    in Optimization, Maiden-head, UK McGraw-Hill\n                , pp. 11-32."},{"volume-title":"Simulated annealing","year":"1993","author":"Dowsland, K.A.","key":"atypb13"},{"volume-title":"Computers and Intractability: A Guide to the theory of NP-Completeness","year":"1979","author":"Gary, M.R.","key":"atypb14"},{"volume-title":"Proceedings of Principles and Practices of Constraint Programming - CP96, LNCS 1118","author":"Gent, I.P.","key":"atypb15"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90012-C"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.4"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/71.265940"},{"volume-title":"Proceedings of the 9th Workshop on JSSPP at GGF8","author":"Hovestadt, M.","key":"atypb21"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/10719839_7"},{"issue":"1","key":"atypb23","first-page":"1","volume":"32","author":"Kacem, I.","year":"2001","journal-title":"Part C"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4754(02)00019-8"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321808"},{"volume-title":"Duplication Scheduling Heuristics (DSH): A New Precedence Task Scheduler for Parallel Processor Systems","year":"1987","author":"Kruatrachue, B.","key":"atypb27"},{"issue":"1","key":"atypb28","first-page":"32","volume":"13","author":"Kumar, V.","year":"1992","journal-title":"AI Magazine"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"volume-title":"Proceedings of 2nd European Across Grids Conference","author":"Lovas, R.","key":"atypb30"},{"key":"atypb31","first-page":"146","volume":"128","author":"Ludtke, S.","year":"1999","journal-title":"Journal of Structure Biology"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh091"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.6.797"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-005-6364-5"},{"volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99","author":"Pelikan, M.","key":"atypb36"},{"key":"atypb37","volume":"99018","author":"Pelikan, M.","year":"1999","journal-title":"Tech. Rep."},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2007.015769"},{"volume-title":"Proceedings of the 5th International Conference on Grid and Cooperative Computing(GCC 2006)","author":"Quan, D.M.","key":"atypb39"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265905001411"},{"volume-title":"Proceedings of the International Conference on High Performance Computing and Communications (HPPC-05)","author":"Quan, D.M.","key":"atypb41"},{"volume-title":"Proceedings of the 19th IEEE International Conference on Advanced Information Networking and Applications (AINA 2005)","author":"Quan, D.M.","key":"atypb42"},{"volume-title":"Proceedings of the European Grid Conference(EGC 2005)","author":"Quan, D.M.","key":"atypb43"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90042-N"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00098-4"},{"key":"atypb46","doi-asserted-by":"crossref","unstructured":"Sahai, A.\n                 (2002). Automated SLA monitoring for web services, DSOM 2002,\n                    LNCS, Berlin:\n                    Springer-Verlag , pp.\n                28-41.","DOI":"10.1007\/3-540-36110-3_6"},{"volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","year":"1989","author":"Sarkar, V.","key":"atypb47"},{"volume-title":"Proceedings of the Conference on European Design Automation","author":"Shahid, A.","key":"atypb48"},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1109\/71.242160"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20030280"},{"volume-title":"Iterated local search for the quadratic assignment problem, Tech. Rep. Aida-99-03, FG Intellektik, TU Darmstadt","year":"1999","author":"St\u00fctzle, T.","key":"atypb51"},{"volume-title":"Local Search Algorithms for Combinatorial Problems-Analysis, Algorithms and New Applications, DISKI-Dissertationen zur K\u00fcnstliken Intelligenz","year":"1999","author":"St\u00fctzle, T.","key":"atypb52"},{"volume-title":"Guided Local Search for Combinatorial Optimization Problems","year":"1997","author":"Voudouris, C.","key":"atypb53"},{"issue":"2","key":"atypb54","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"Voudouris, C.","year":"1999","journal-title":"European Journal of Operation Research"},{"key":"atypb55","doi-asserted-by":"publisher","DOI":"10.1145\/773056.773064"},{"key":"atypb56","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.11"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342007086230","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342007086230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T09:36:01Z","timestamp":1738056961000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342007086230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1177\/1094342007086230"],"URL":"https:\/\/doi.org\/10.1177\/1094342007086230","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}