{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:47:34Z","timestamp":1725569254013},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/nca.2005.43","type":"proceedings-article","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T14:52:38Z","timestamp":1136472758000},"page":"186-196","source":"Crossref","is-referenced-by-count":1,"title":["Reducing the Communication Cost via Chain Pattern Scheduling"],"prefix":"10.1109","author":[{"given":"F.M.","family":"Ciorba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Andronikos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Drositis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Papakonstantinou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Tsanakas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/12.995454"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1011417"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00766-X"},{"key":"12","article-title":"On the parallelization of UET\/UET-UCT loops","author":"papakonstantinou","year":"2001","journal-title":"NPSC J on Computing"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2002.1850"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/71.655248"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/71.722221"},{"journal-title":"Patterns for Parallel Programming","year":"2004","author":"mattson","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00018-2"},{"journal-title":"Comp and Intractability a Guide to the Theory of NP-completeness","year":"1979","author":"garey","key":"6"},{"key":"5","article-title":"Geometric pattern prediction and scheduling of uniform dependence loops","author":"drositis","year":"0","journal-title":"5th Hellenic Eur Conf on Comp Math and its Appl - HERCMA 2001"},{"key":"4","article-title":"Optimal loop parallelization in n-dimensional index spaces","author":"drositis","year":"2002","journal-title":"Proc of the 2002 Int'l Conf on Par and Dist Proc Techn and Appl (PDPTA'02)"},{"key":"9","article-title":"Patterns for parallel application programs","author":"massingill","year":"1999","journal-title":"Proc of the 6th Pattern Lang of Prog (PLoP '99)"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/71.914756"}],"event":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","start":{"date-parts":[[2005,7,27]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2005,7,29]]}},"container-title":["Fourth IEEE International Symposium on Network Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10472\/33219\/01565952.pdf?arnumber=1565952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T21:38:18Z","timestamp":1489613898000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1565952\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/nca.2005.43","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}