{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:25:03Z","timestamp":1767857103807,"version":"3.49.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,12,22]],"date-time":"2015-12-22T00:00:00Z","timestamp":1450742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Spanish Miinistry of Science and Innovation","award":["TIN2012-34557"],"award-info":[{"award-number":["TIN2012-34557"]}]},{"name":"Eropean Unions 7th FP, ERC","award":["321253"],"award-info":[{"award-number":["321253"]}]},{"name":"Spanish Goverment Severo Ochoa","award":["SEV-2011-00067"],"award-info":[{"award-number":["SEV-2011-00067"]}]},{"name":"Secretary for Universities and Research of the Ministry of Economy and Knowledge of the Goverment of Catalonia"},{"name":"Juan de la Cierva post-doctoral fellowship","award":["JCI-2012-15047"],"award-info":[{"award-number":["JCI-2012-15047"]}]},{"name":"Marie Curie Actions of the 7th R&D Framework Programme of teh European Union","award":["2013 BP B 00243"],"award-info":[{"award-number":["2013 BP B 00243"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2016,1,7]]},"abstract":"<jats:p>In this work, we show how parallel applications can be implemented efficiently using task parallelism. We also evaluate the benefits of such parallel paradigm with respect to other approaches. We use the PARSEC benchmark suite as our test bed, which includes applications representative of a wide range of domains from HPC to desktop and server applications. We adopt different parallelization techniques, tailored to the needs of each application, to fully exploit the task-based model. Our evaluation shows that task parallelism achieves better performance than thread-based parallelization models, such as Pthreads. Our experimental results show that we can obtain scalability improvements up to 42% on a 16-core system and code size reductions up to 81%. Such reductions are achieved by removing from the source code application specific schedulers or thread pooling systems and transferring these responsibilities to the runtime system software.<\/jats:p>","DOI":"10.1145\/2829952","type":"journal-article","created":{"date-parts":[[2015,12,22]],"date-time":"2015-12-22T14:11:19Z","timestamp":1450793479000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["PARSECSs"],"prefix":"10.1145","volume":"12","author":[{"given":"Dimitrios","family":"Chasapis","sequence":"first","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Casas","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miquel","family":"Moret\u00f3","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Vidal","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduard","family":"Ayguad\u00e9","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Labarta","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateo","family":"Valero","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center and Universitat Politecnica de Catalunya--BarcelonaTech, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,12,22]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Mahoney","author":"Adcock Aaron B.","year":"2013","unstructured":"Aaron B. Adcock , Blair D. Sullivan , Oscar R. Hernandez , and Michael W . Mahoney . 2013 . Evaluating OpenMP tasking at scale for the computation of graph hyperbolicity. In OpenMP in the Era of Low Power Devices and Accelerators. Lecture Notes in Computer Science, Vol. 8122 . Springer , 71--83. DOI:http:\/\/dx.doi.org\/10.1007\/978-3-642-40698-0_6 10.1007\/978-3-642-40698-0_6 Aaron B. Adcock, Blair D. Sullivan, Oscar R. Hernandez, and Michael W. Mahoney. 2013. Evaluating OpenMP tasking at scale for the computation of graph hyperbolicity. In OpenMP in the Era of Low Power Devices and Accelerators. Lecture Notes in Computer Science, Vol. 8122. Springer, 71--83. DOI:http:\/\/dx.doi.org\/10.1007\/978-3-642-40698-0_6"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562112.1562118"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.105"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85261-2_5"},{"key":"e_1_2_2_5_1","volume-title":"Parallel Algorithms for VLSI Computer-Aided Design","author":"Banerjee Prithviraj","unstructured":"Prithviraj Banerjee . 1994. Parallel Algorithms for VLSI Computer-Aided Design . Prentice Hall . Prithviraj Banerjee. 1994. Parallel Algorithms for VLSI Computer-Aided Design. Prentice Hall."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188546"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1086\/260062"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"e_1_2_2_11_1","volume-title":"Programming with POSIX Threads","author":"Butenhof David R.","unstructured":"David R. Butenhof . 1997. Programming with POSIX Threads . Addison Wesley Longman . David R. Butenhof. 1997. Programming with POSIX Threads. Addison Wesley Longman."},{"key":"e_1_2_2_12_1","volume-title":"Advanced Parallel Processing Technologies","author":"Chapman Barbara","unstructured":"Barbara Chapman . 2007. The multicore programming challenge . In Advanced Parallel Processing Technologies . Springer . DOI:http:\/\/dx.doi.org\/10.1007\/978-3-540-76837-1_3 10.1007\/978-3-540-76837-1_3 Barbara Chapman. 2007. The multicore programming challenge. In Advanced Parallel Processing Technologies. Springer. DOI:http:\/\/dx.doi.org\/10.1007\/978-3-540-76837-1_3"},{"key":"e_1_2_2_13_1","unstructured":"Barbara Chapman Gabriele Jost and Ruud van der Pas. 2007. Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation). MIT Press Cambridge MA.   Barbara Chapman Gabriele Jost and Ruud van der Pas. 2007. Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation). MIT Press Cambridge MA."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065944.1065950"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508148.2485949"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)00001-6"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626411000151"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-009-0101-1"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188543"},{"key":"e_1_2_2_20_1","volume-title":"Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI\u201903)","author":"Grahne Gosta","year":"2003","unstructured":"Gosta Grahne and Jianfei Zhu . 2003 . Efficiently using prefix-trees in mining frequent itemsets . In Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI\u201903) . http:\/\/dblp.uni-trier.de\/db\/conf\/fimi\/fimi2003.html#GrahneZ03. Gosta Grahne and Jianfei Zhu. 2003. Efficiently using prefix-trees in mining frequent itemsets. In Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI\u201903). http:\/\/dblp.uni-trier.de\/db\/conf\/fimi\/fimi2003.html#GrahneZ03."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2951677"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038037.1941563"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.115"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486174"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218063.1217966"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/846276.846298"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/653765"},{"key":"e_1_2_2_29_1","unstructured":"OpenMP Architecture Review Board. 2013. OpenMP Application Program Interface Version 3.0. http:\/\/www.openmp.org\/mp-documents\/openmp-4.5.pdf.  OpenMP Architecture Review Board. 2013. OpenMP Application Program Interface Version 3.0. http:\/\/www.openmp.org\/mp-documents\/openmp-4.5.pdf."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342009106195"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of the 3rd Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG\u201910)","author":"Podobas Artur","year":"2010","unstructured":"Artur Podobas and Mats Brorsson . 2010 . A comparison of some recent task-based parallel programming models . In Proceedings of the 3rd Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG\u201910) . Artur Podobas and Mats Brorsson. 2010. A comparison of some recent task-based parallel programming models. In Proceedings of the 3rd Workshop on Programmability Issues for Multi-Core Computers (MULTIPROG\u201910)."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083323.1083333"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073208"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488551.2488558"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145864"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503233"},{"key":"e_1_2_2_37_1","volume-title":"Proceedings of the 3rd USENIX Conference on Hot Topic in Parallelism (HotPar\u201911)","author":"Vandierendonck Hans","year":"2001","unstructured":"Hans Vandierendonck , Polyvios Pratikakis , and Dimitrios S. Nikolopoulos . 2011. Parallel programming of general-purpose programs using task-based programming models . In Proceedings of the 3rd USENIX Conference on Hot Topic in Parallelism (HotPar\u201911) . 13. http:\/\/dl.acm.org\/citation.cfm?id&equals; 2001 252.2001265. Hans Vandierendonck, Polyvios Pratikakis, and Dimitrios S. Nikolopoulos. 2011. Parallel programming of general-purpose programs using task-based programming models. In Proceedings of the 3rd USENIX Conference on Hot Topic in Parallelism (HotPar\u201911). 13. http:\/\/dl.acm.org\/citation.cfm?id&equals;2001252.2001265."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000417.2000424"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2829952","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2829952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:06Z","timestamp":1750272966000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2829952"}},"subtitle":["Evaluating the Impact of Task Parallelism in the PARSEC Benchmark Suite"],"short-title":[],"issued":{"date-parts":[[2015,12,22]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,1,7]]}},"alternative-id":["10.1145\/2829952"],"URL":"https:\/\/doi.org\/10.1145\/2829952","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,22]]},"assertion":[{"value":"2015-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}