{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:43Z","timestamp":1725490063426},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729082"},{"type":"electronic","value":"9783540729099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72909-9_25","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T04:34:14Z","timestamp":1187670854000},"page":"229-234","source":"Crossref","is-referenced-by-count":1,"title":["Policy Based Scheduling for Resource Allocation on Grid"],"prefix":"10.1007","author":[{"given":"Sung-hoon","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moo-hun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jang-uk","family":"In","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bong-hoi","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eui-in","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.jpdc.2005.01.002","volume":"65","author":"G.Q. Liu","year":"2005","unstructured":"Liu, G.Q., Poh, K.L., Xie, M.: Iterative list scheduling for heterogeneous computing. Journal of Parallel and Distributed Computing\u00a065(5), 654\u2013665 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y.K. Kwok","year":"1996","unstructured":"Kwok, Y.K., Ahmad, I.: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Transactions on Parallel and Distributed Systems\u00a07(5), 506\u2013521 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"25_CR3","unstructured":"Qin, X., Jiang, H.: Reliability-driven scheduling for real-time tasks with precedence constraints in heterogeneous distributed systems. In: Proceedings of the International Conference Parallel and Distributed Computing and Systems 2000 (PDCS 2000), Las Vegas, USA (November 2000)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36978-3","volume-title":"Euro-Par 2003 Parallel Processing","author":"H. Zhao","year":"2003","unstructured":"Zhao, H., Sakellariou, R.: An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Web and Network Technologies, and Information Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72909-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:50:47Z","timestamp":1619517047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72909-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729082","9783540729099"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72909-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}