{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:43Z","timestamp":1725455983201},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616276"},{"type":"electronic","value":"9783540706366"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/bfb0024745","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:17:56Z","timestamp":1132366676000},"page":"535-538","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compile-time task scheduling for multi-phase programming"],"prefix":"10.1007","author":[{"given":"A.","family":"Benaini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Laiymani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"68_CR1","first-page":"278","volume":"23","author":"J-M. Adamo","year":"1994","unstructured":"J-M. Adamo and L. Trejo. Programming Environment for Phase-reconfigurable Parallel Programming on Supernode. JPDC, 23:278\u2013292, 1994.","journal-title":"JPDC"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"A. Benaini and D. Laiymani. Compile-time Task Graph Scheduling for Multi-phase Programming. Technical report, LIB \u2014 http:\/\/comte.univ-fcomte.fr, 1996.","DOI":"10.1007\/BFb0024745"},{"key":"68_CR3","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979."},{"issue":"1","key":"68_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/71.481597","volume":"7","author":"M.A. Palis","year":"1996","unstructured":"M.A. Palis, J. Liou, and D.S.L. Wei. Task Custering and Scheduling for Distributed Memory Parallel Architectures. IEEE Trans. on Parallel and Distributed Systems, 7(1):46\u201355, 1996.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"68_CR5","unstructured":"V. Sarkar. Partitionning and Scheduling Parallel Programs for Execution on Multi-processors. M.I.T. Press, 1989."},{"key":"68_CR6","first-page":"47","volume":"15","author":"L. Snyder","year":"1982","unstructured":"L. Snyder. Introduction to the Configurable, Highly Parallel Computer. J. Par. Distr. Comp., 15:47\u201356, 1982.","journal-title":"J. Par. Distr. Comp."},{"key":"68_CR7","unstructured":"T. Yang. Scheduling and Code Generation for Parallel Architectures. PhD thesis, Rutgers University, 1993."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:34:59Z","timestamp":1587328499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616276","9783540706366"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0024745","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"10 June 2005","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"}]}}