{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:59:38Z","timestamp":1725577178903},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669074"},{"type":"electronic","value":"9783540466420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-46642-0_20","type":"book-chapter","created":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T18:35:26Z","timestamp":1296239726000},"page":"143-150","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Algorithms for Scheduling Static Task Graphs in Dynamic Distributed Systems"],"prefix":"10.1007","author":[{"given":"Prashanti","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dibyendu","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pallab","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jpdc.1997.1416","volume":"49","author":"D. Das","year":"1998","unstructured":"Das, D., Dasgupta, P., Das, P.P.: A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning. Journal of Parallel and Distributed Computing\u00a049, 169\u2013181 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Kruatrachue, B., Lewis, T.: Grain size determination for parallel programs. IEEE Software, 23\u201332 (January 1998)","DOI":"10.1109\/52.1991"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/71.481597","volume":"7","author":"M.A. Palis","year":"1996","unstructured":"Palis, M.A., Liou, J.C., Wei, D.S.L.: Task Clustering and Scheduling for Distributed Memory Parallel Architectures. IEEE Transactions on Parallel and Distributed Systems\u00a07(1), 46\u201354 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/0219021","volume":"19","author":"C.H. Papadimitriou","year":"1990","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Towards an architecture independent analysis of parallel programs. SIAM J. Computing\u00a019(2), 138\u2013153 (1990)","journal-title":"SIAM J. Computing"},{"key":"20_CR5","volume-title":"Task Scheduling for Parallel and Distributed Systems","author":"H.E. Rewini","year":"1994","unstructured":"Rewini, H.E., Lewis, T., Ali, H.H.: Task Scheduling for Parallel and Distributed Systems. Prentice-Hall, Englewood Cliffs (1994)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46642-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T05:57:43Z","timestamp":1559973463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46642-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669074","9783540466420"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46642-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}