{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:23Z","timestamp":1725467783215},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649526"},{"type":"electronic","value":"9783540499206"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0057951","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:01:27Z","timestamp":1154444487000},"page":"940-943","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Scheduling Fork graphs under LogP with an unbounded number of processors"],"prefix":"10.1007","author":[{"given":"Iskander","family":"Kort","sequence":"first","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"117_CR1","unstructured":"P. Chr\u00e9tienne. Task Scheduling over Distributed Memory Machines. In North Holland, editor, International Workshop on Parallel and Distributed Algorithms, 1989."},{"key":"117_CR2","volume-title":"Technical Report 90.5","author":"P. Chr\u00e9tienne","year":"1990","unstructured":"P. Chr\u00e9tienne. Complexity of Tree-scheduling with Interprocessor Communication Delays. Technical Report 90.5, MASI, Pierre and Marie Curie University, Paris, 1990."},{"issue":"11","key":"117_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/240455.240477","volume":"39","author":"D. E. Culler","year":"1996","unstructured":"D. E. Culler et al. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78\u201385, November 1996.","journal-title":"Communications of the ACM"},{"issue":"1","key":"117_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0129054197000045","volume":"8","author":"L. Finta","year":"1997","unstructured":"L. Finta and Z. Liu. Complexity of Task Graph Scheduling with Fixed Communication Capacity. International Journal of Foundations of Computer Science, 8(1):43\u201366, 1997.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"117_CR5","unstructured":"W. L\u00f6we, M. Middendorf, and W. Zimmermann. Scheduling Inverse Trees under the Communication Model of the LogP-Machine. Theoretical Computer Science, 1997. to appear."},{"key":"117_CR6","unstructured":"J. Verriet. Scheduling Tree-structured Programs in the Logp Model. Technical Report UU-CS-1997-18, Department of Computer Science, Utrecht University, 1997."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201998 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:08:41Z","timestamp":1587341321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649526","9783540499206"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0057951","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}