{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:51Z","timestamp":1763468151370,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T00:00:00Z","timestamp":1379289600000},"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":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2013,9,16]]},"abstract":"<jats:p>Stream-based parallel languages are a popular way to express parallelism in modern applications. The efficient mapping of streaming parallelism to today's multicore systems is, however, highly dependent on the program and underlying architecture. We address this by developing a portable and automatic compiler-based approach to partitioning streaming programs using machine learning. Our technique predicts the ideal partition structure for a given streaming application using prior knowledge learned offline. Using the predictor we rapidly search the program space (without executing any code) to generate and select a good partition. We applied this technique to standard StreamIt applications and compared against existing approaches. On a 4-core platform, our approach achieves 60% of the best performance found by iteratively compiling and executing over 3000 different partitions per program. We obtain, on average, a 1.90\u00d7 speedup over the already tuned partitioning scheme of the StreamIt compiler. When compared against a state-of-the-art analytical, model-based approach, we achieve, on average, a 1.77\u00d7 performance improvement. By porting our approach to an 8-core platform, we are able to obtain 1.8\u00d7 improvement over the StreamIt default scheme, demonstrating the portability of our approach.<\/jats:p>","DOI":"10.1145\/2512436","type":"journal-article","created":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T13:47:05Z","timestamp":1379944025000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Using machine learning to partition streaming programs"],"prefix":"10.1145","volume":"10","author":[{"given":"Zheng","family":"Wang","sequence":"first","affiliation":[{"name":"University of Edinburgh, Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael F. P.","family":"O'boyle","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1693453.1693494"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1145\/1562764.1562783"},{"volume-title":"Pattern Recognition and Machine Learning","author":"Bishop C. M.","key":"e_1_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1016\/0020-0190(92)90140-Q"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1145\/240455.240477"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1145\/1065010.1065039"},{"unstructured":"Duda R. O. Hart P. E. and Stork D. G. 2000. Pattern Classification 2nd Ed. Wiley-Interscience.   Duda R. O. Hart P. E. and Stork D. G. 2000. Pattern Classification 2 nd Ed. Wiley-Interscience.","key":"e_1_2_1_7_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1145\/1168857.1168877"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1145\/605397.605428"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1145\/1944862.1944881"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_1","DOI":"10.1109\/PACT.2009.39"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/1356058.1356080"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1145\/1375581.1375596"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1145\/344588.344618"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1109\/PROC.1987.13876"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1109\/CGO.2006.13"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1145\/1669112.1669121"},{"volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS'97)","author":"Moss E.","key":"e_1_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1109\/PACT.2009.28"},{"volume-title":"Proceedings of the 17th International Conference on Machine Learning (ICML'00)","author":"Pelleg D.","key":"e_1_2_1_20_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1145\/1375581.1375594"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1109\/MS.1984.234713"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1147\/rd.355.0779"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.1214\/aos\/1176344136"},{"doi-asserted-by":"publisher","key":"e_1_2_1_25_1","DOI":"10.1145\/605397.605403"},{"doi-asserted-by":"publisher","key":"e_1_2_1_26_1","DOI":"10.1007\/s002360050095"},{"doi-asserted-by":"publisher","key":"e_1_2_1_27_1","DOI":"10.1109\/CGO.2005.29"},{"doi-asserted-by":"publisher","key":"e_1_2_1_28_1","DOI":"10.1145\/781131.781141"},{"volume-title":"Proceedings of the International Conference on Compiler Construction (CC'01)","author":"Thies B.","key":"e_1_2_1_29_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_31_1","DOI":"10.1145\/1854273.1854319"},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1145\/1542476.1542496"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_1","DOI":"10.1109\/CGO.2009.20"},{"doi-asserted-by":"publisher","key":"e_1_2_1_34_1","DOI":"10.1145\/1504176.1504189"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1145\/1854273.1854313"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2512436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2512436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:59Z","timestamp":1750231739000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2512436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9,16]]}},"alternative-id":["10.1145\/2512436"],"URL":"https:\/\/doi.org\/10.1145\/2512436","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2013,9,16]]},"assertion":[{"value":"2011-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}