{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:27Z","timestamp":1750307007177,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,2,23]]},"DOI":"10.1145\/2442992.2443005","type":"proceedings-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T15:23:04Z","timestamp":1361892184000},"page":"115-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling directives for shared-memory many-core processor systems"],"prefix":"10.1145","author":[{"given":"Oded","family":"Green","sequence":"first","affiliation":[{"name":"Computational Science and Engineering, Georgia Institute of Technology, Atlanta, Georgia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yitzhak","family":"Birk","sequence":"additional","affiliation":[{"name":"Electrical Engineering Technion, Israel Institute of Technology, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Analysis: 'Hypercore' Touts 256 CPUs Per Chip. EE Times www.eetimes.com\/design\/signal-processing-dsp\/4017491\/Analysis--Hypercore-touts-256-CPUs-per-chip.2007).  Analysis: 'Hypercore' Touts 256 CPUs Per Chip. EE Times www.eetimes.com\/design\/signal-processing-dsp\/4017491\/Analysis--Hypercore-touts-256-CPUs-per-chip.2007)."},{"key":"e_1_3_2_1_2_1","unstructured":"HyperCore Software Developer's Handbook ed: Plurality Online: www.plurality.com2009).  HyperCore Software Developer's Handbook ed: Plurality Online: www.plurality.com2009)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366230.1366240"},{"key":"e_1_3_2_1_4_1","volume-title":"HARDWARE DESIGN","author":"Wen X.","year":"2008","unstructured":"Wen , X. HARDWARE DESIGN , PROTOTYPING AND STUDIES OF THE EXPLICIT MULTI-THREADING (XMT) PARADIGM. University of Maryland , 2008 . Wen, X. HARDWARE DESIGN, PROTOTYPING AND STUDIES OF THE EXPLICIT MULTI-THREADING (XMT) PARADIGM. University of Maryland, 2008."},{"key":"e_1_3_2_1_5_1","author":"Graham R.","year":"1966","unstructured":"Graham , R. Bounds for certain multiprocessing anomalies. Bell System Technical Journal , XLV , No 9 1966 ). Graham, R. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, XLV, No 9 1966).","journal-title":"Bell System Technical Journal"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800009.808055"},{"journal-title":"Rinnooy Kan Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 5","author":"Graham R., E.","key":"e_1_3_2_1_7_1","unstructured":"Graham , R., E. Lawler , E. Lenstra , A. Rinnooy Kan Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 5 1979), 287--326. Graham, R., E. Lawler, E. Lenstra, A. Rinnooy Kan Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals of Discrete Mathematics, 51979), 287--326."},{"key":"e_1_3_2_1_8_1","volume-title":"Scheduling algorithms","author":"Brucker P.","year":"2007","unstructured":"Brucker , P. Scheduling algorithms . Springer , 2007 . Brucker, P. Scheduling algorithms. Springer, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1002\/0470121173","volume-title":"Task scheduling for parallel systems","author":"Sinnen O.","year":"2007","unstructured":"Sinnen , O. Task scheduling for parallel systems . Wiley-Interscience , Hoboken, N. J. , 2007 . Sinnen, O. Task scheduling for parallel systems. Wiley-Interscience, Hoboken, N. J., 2007."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.207593"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.503776"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791218664"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"1990","unstructured":"Cormen , T. H. , Leiserson , C. E. and Rivest , R. L . Introduction to algorithms . MIT Press ;McGraw-Hill, Cambridge, Mass., 1990 . Cormen, T. H., Leiserson, C. E. and Rivest, R. L. Introduction to algorithms. MIT Press;McGraw-Hill, Cambridge, Mass., 1990."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.111.0025"},{"key":"e_1_3_2_1_15_1","volume-title":"Amsterdam","author":"Hennessy J. L.","year":"2007","unstructured":"Hennessy , J. L. , Patterson , D. A. and Arpaci-Dusseau , A. C. Computer architecture: a quantitative approach. Morgan Kaufmann , Amsterdam ; Boston , 2007 . Hennessy, J. L., Patterson, D. A. and Arpaci-Dusseau, A. C. Computer architecture: a quantitative approach. Morgan Kaufmann, Amsterdam; Boston, 2007."},{"key":"e_1_3_2_1_16_1","unstructured":"NVIDIA CUDA#8482; Programming Guide Version 3.0. NVIDIA CUDA #8482; Programming Guide Version 3.0 ."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401132.1401152"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Intel\u00ae Concurrent Collections 2012. Intel\u00ae Concurrent Collections 2012.","DOI":"10.1155\/2012\/691864"}],"event":{"name":"PPoPP '13: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Shenzhen Guangdong China","acronym":"PPoPP '13"},"container-title":["Proceedings of the 2013 International Workshop on Programming Models and Applications for Multicores and Manycores"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442992.2443005","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442992.2443005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:57Z","timestamp":1750236537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442992.2443005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":18,"alternative-id":["10.1145\/2442992.2443005","10.1145\/2442992"],"URL":"https:\/\/doi.org\/10.1145\/2442992.2443005","relation":{},"subject":[],"published":{"date-parts":[[2013,2,23]]},"assertion":[{"value":"2013-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}