{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:03:42Z","timestamp":1725901422097},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642052521"},{"type":"electronic","value":"9783642052538"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05253-8_57","type":"book-chapter","created":{"date-parts":[[2009,11,20]],"date-time":"2009-11-20T11:31:05Z","timestamp":1258716665000},"page":"517-525","source":"Crossref","is-referenced-by-count":0,"title":["A Controlled Scheduling Algorithm Decreasing the Incidence of Starvation in Grid Environments"],"prefix":"10.1007","author":[{"given":"Minna","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kairi","family":"Ou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuelong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","volume-title":"The Grid2, Blueprint for a New Computing Infrastructure","author":"I. Foster","year":"2004","unstructured":"Foster, I., Kesselman, C.: The Grid2, Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (2004)"},{"key":"57_CR2","unstructured":"Abraham, A., Buyya, R., Nath, B.: Nature\u2019s Heuristics for scheduling Jobs on Computa-tional Grids. In: ADCOM 2000, Cochin, India, pp. 45\u201352 (2000)"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Kwok, Y.-K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. In: ACM Computing Surveys, New York, pp. 406\u2013471 (1999)","DOI":"10.1145\/344588.344618"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Maheswaran, M., Ali, S., Siegel, H.: Dynamic Matching and Scheduling of a Class of In-dependent Tasks onto Heterogeneous Computing Systems. In: Eigth Heterogeneous Computing Workshop, San Juan, Pueto Rico (April 1999)","DOI":"10.1109\/HCW.1999.765094"},{"issue":"2","key":"57_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jpdc.1999.1581","volume":"59","author":"M. Maheswaran","year":"1999","unstructured":"Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems. Journal of Parallel and Distributed Computing\u00a059(2), 107\u2013131 (1999)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"SaiRanga, P.C., Baskiyar, S.: A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems. In: Proceedings of the 43rd annual Southeast regional conference, New York, pp. 63\u201368 (2005)","DOI":"10.1145\/1167350.1167380"},{"key":"57_CR7","volume-title":"Scheduling-theory, algorithms, and systems, ch. 4","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling-theory, algorithms, and systems, ch. 4. Prentice Hall, Englewood Cliffs (1995)"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Cuesta, B., Robles, A., Duato, J.: An Effective Starvation Avoidance Mechanism to Enhance the Token Coherence Protocol. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Washington, pp. 47\u201354 (2007)","DOI":"10.1109\/PDP.2007.22"},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., et al.: Optimization and Approximation in Determi-nistic Sequencing and Scheduling. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05253-8_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:49:55Z","timestamp":1606168195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05253-8_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052521","9783642052538"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05253-8_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}