{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T06:08:30Z","timestamp":1740895710726,"version":"3.38.0"},"reference-count":14,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"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":[[2006,2]]},"abstract":"<jats:p> In this paper, we address the problem of dynamically scheduling independent tasks and\/or application task graphs on a GridRPC environment. Resources are assumed to compute submitted jobs within the time-share model. We present a non-intrusive predictive module, the historical trace manager (HTM), which is able to give the completion date of each task in the system. Four heuristics relying on its estimations are proposed and compared to the well-known minimum completion time (MCT) algorithm. We first analyze the accuracy of the HTM. Then we show with an extensive simulation study, and with numerous scenarios of execution performed on a real-world platform, that our heuristics outperform MCT on several metrics among which are the makespan and the response time. <\/jats:p>","DOI":"10.1177\/1094342006061890","type":"journal-article","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T11:48:09Z","timestamp":1138880889000},"page":"61-76","source":"Crossref","is-referenced-by-count":3,"title":["Multicriteria Scheduling Heuristics for Gridrpc Systems"],"prefix":"10.1177","volume":"20","author":[{"given":"Yves","family":"Caniou","sequence":"first","affiliation":[{"name":"UNIVERSIT\u00c9 CLAUDE BERNARD LYON 1"}]},{"given":"Emmanuel","family":"Jeannot","sequence":"additional","affiliation":[{"name":"INRIA LORRAINE LORIA (UMR 7503, CNRS, INPL, INRIA, UNIVERSIT\u00c9\r                        HENRI POINCAR\u00c9 NANCY 1, UNIVERSIT\u00c9 NANCY 2,"}]}],"member":"179","published-online":{"date-parts":[[2006,2,1]]},"reference":[{"volume-title":"Introduction to Sequencing and Scheduling","year":"1974","author":"Baker, K. R.","key":"atypb1"},{"volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Bender, M. A.","key":"atypb2"},{"volume-title":"Dynamic mapping of a metatask on the grid: historical trace, minimum perturbation and minimum length heuristics","year":"2002","author":"Caniou, Y.","key":"atypb3"},{"key":"atypb4","unstructured":"Caron, A., Desprez, F., Fleury, E., Lombard, F., Nicod, J.M., Quinson, M.\n                and Suter, F. 2002. Calcul r\u00c9parti \u00e0 grande\n                \u00c9chelle, chapter \u201cUne approche hi\u00e9rarchique des\n                serveurs de calculs\u201d, Herm\u00e8s Science, Paris."},{"first-page":"430","volume-title":"Proceedings of the IEEE Symposium on Cluster Computing and the Grid (CCGrid\u201901)","author":"Casanova, H.","key":"atypb5"},{"volume-title":"Proceedings of Supercomputing","author":"Casanova, H.","key":"atypb6"},{"volume-title":"The Gnu Standard Library","year":"1996","author":"Galassi, M.","key":"atypb7"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1145\/242857.242867"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1581"},{"volume-title":"A gridRPC model and API for enduser applications, December","year":"2003","author":"Nakada, H.","key":"atypb10"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(99)00016-3"},{"volume-title":"Proceedings of the International Workshop on Performance Modeling, Evaluation and Optimization of Parallel and Distributed Systems (PMEO-PDS\u201902)","author":"Quinson, M.","key":"atypb12"},{"volume-title":"Proceedings of the 10th International International Parallel Processing Symposium, Heterogeneous-Computing Workshop","author":"Weissman, J. B.","key":"atypb13"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(99)00025-4"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342006061890","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342006061890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T02:34:04Z","timestamp":1740882844000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342006061890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1177\/1094342006061890"],"URL":"https:\/\/doi.org\/10.1177\/1094342006061890","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}