{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:33Z","timestamp":1742617233219,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635741"},{"type":"electronic","value":"9783540695998"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63574-2_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:30:04Z","timestamp":1330299004000},"page":"193-214","source":"Crossref","is-referenced-by-count":2,"title":["Objective-oriented algorithm for job scheduling in parallel heterogeneous systems"],"prefix":"10.1007","author":[{"given":"Pham Hong","family":"Hanh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valery","family":"Simonenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,12]]},"reference":[{"key":"9_CR1","volume-title":"Theorie des graphes et ses application","author":"C. Berge","year":"1958","unstructured":"C. Berge, Theorie des graphes et ses application, Dunod, Paris, 1958."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0167-8191(94)90110-4","volume":"20","author":"J. Blazevicz","year":"1994","unstructured":"J. Blazevicz, M. Drozdowski, G. Schmidt, and D. De Werra, \u201cScheduling independent multiprocessor tasks on a uniform k-processor system\u201d, Journal of Parallel Computer 20, pp. 15\u201328, 1994.","journal-title":"Journal of Parallel Computer"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"T. Bultan and C. Aykanat, \u201cA new mapping heuristic based on mean field annealing\u201d, Journal of Parallel and Distributed Computing, Vol. 16, N4, December 1992.","DOI":"10.1016\/0743-7315(92)90013-D"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/32.4634","volume":"14","author":"T.L. Casavant","year":"1988","unstructured":"T.L. Casavant and J.G. Kuhl, \u201cA taxonomy of scheduling in general-purpose distributed computing systems\u201d, IEEE Trans. Softw.Eng.14, pp. 141\u2013154, 1988.","journal-title":"IEEE Trans. Softw.Eng."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"K. Efe, \u201cHeuristic models for task assignment scheduling in distributed systems\u201d, IEEE Computer, June 1982.","DOI":"10.1109\/MC.1982.1654050"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H. El-Rewini","year":"1990","unstructured":"H. El-Rewini and T.G. Lewis, \u201cScheduling Parallel tasks onto Arbitrary Target Machines\u201d, Journal of Par. and Distr. Com.,Vol.9, pp. 138\u2013153, 1990.","journal-title":"Journal of Par. and Distr. Com."},{"key":"9_CR7","first-page":"659","volume":"2","author":"A. A. Elsadek","year":"1996","unstructured":"A. A. Elsadek and B.E Wells, \u201cHeuristic model for task allocation in a heterogeneous distributed systems\u201d, Proceeding of PDPTA'96, California USA, Vol.2, pp. 659\u2013671, August 1996.","journal-title":"Proceeding of PDPTA'96"},{"key":"9_CR8","first-page":"769","volume":"2","author":"R. F. Freund","year":"1996","unstructured":"R. F Freund, B.R.Carter, Daniel Watson, et al., \u201cGenerational Scheduling for Heterogeneous Computing Systems\u201d, Proceeding of PDPTA'96, California-USA, Vol.2, pp769\u2013778, August 1996.","journal-title":"Proceeding of PDPTA'96"},{"key":"9_CR9","volume-title":"Computer and Intractability\u2014A guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computer and Intractability\u2014A guide to the Theory of NP-completeness, Freeman New York, 1979."},{"key":"9_CR10","volume-title":"Introduction a la combinatorique en vue des aplications","author":"A. Kaufmann","year":"1968","unstructured":"A. Kaufmann, Introduction a la combinatorique en vue des aplications, Dunod, Paris, 1968."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, \u201cOptimization by simulated annealing\u201d, Journal of Science, Vol.220, N.4589, May 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"9_CR12","volume-title":"Combinatory optimization, algorithm and complexity","author":"X. Papadimitry","year":"1985","unstructured":"X. Papadimitry, K. Stayglitsh, Combinatory optimization, algorithm and complexity, Moscow-Mir, 1985."},{"key":"9_CR13","unstructured":"Hanh H. Pham and Valery Simonenko, \u201cA new algorithm and simulation for task assignment in parallel distributed systems\u201d, Proceeding of the l1 th European Simulation Multiconference '96, Budapest-Hungary, pp. 95\u201399, June 1996."},{"key":"9_CR14","first-page":"835","volume":"2","author":"H. H. Pham","year":"1996","unstructured":"Hanh H. Pham and Valery Simonenko, \u201cAdaptation of algorithms for Job-Resource Assignment in Heterogeneous Distributed Systems\u201d, Proceeding of PDPTA'96, California-USA, Vol.2, pp. 835\u2013845, August 1996.","journal-title":"Proceeding of PDPTA'96"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Riedl Reinhard and Richter Lutz, \u201cClassification of Load Distribution Algorithms\u201d, Proceeding of IEEE PDP'96, pp. 404\u2013413, 1996.","DOI":"10.1109\/EMPDP.1996.500613"},{"key":"9_CR16","unstructured":"P.Shroff, D.W Watson, N.F. Flann, and R.F. Freund, \u201cGenetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments\u201d, Proceeding of Heterogeneous Computing Workshop '96, pp.98\u2013104, April 1996."},{"key":"9_CR17","unstructured":"M. Tan, J.K Antonio, et. al., \u201cScheduling and data relocation for sequentially executed subtasks in a heterogeneous computing system\u201d, Proceeding of Heterogeneous Computing Workshop '95, pp 109\u2013120, 1995."},{"key":"9_CR18","first-page":"189","volume":"2","author":"S. Shaharuddin","year":"1996","unstructured":"Salleh Shaharuddin et. al., \u201cA Mean-field Annealing Model For Task Scheduling in Multi-processor Systems\u201d, Proceedings of PDPTA'96, California-USA, Vol.2, pp. 189\u2013198, August 1996.","journal-title":"Proceedings of PDPTA'96"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8191(94)90109-0","volume":"20","author":"S. S. Wu","year":"1994","unstructured":"Shen S. Wu and David Sweeting, \u201cHeuristic algorithms for task assignment and scheduling in a processor network\u201d, Journal of Parallel Computing 20, pp. 1\u201314, 1994.","journal-title":"Journal of Parallel Computing"},{"key":"9_CR20","first-page":"823","volume":"2","author":"H. Zhou","year":"1996","unstructured":"Honbo Zhou, Scheduling DAGs on a Bounded number of Processors, Proceedings of PDPTA'96, Vol.2, pp. 823\u2013834, August 1996.","journal-title":"Proceedings of PDPTA'96"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63574-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:44:09Z","timestamp":1742600649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63574-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635741","9783540695998"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-63574-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}