{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:11:14Z","timestamp":1685351474836},"reference-count":0,"publisher":"National Library of Serbia","issue":"3","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2012]]},"abstract":"<jats:p>Nowadays, one of the most important challenges in programming is the\n   efficient usage of multicore processors. All modern programming languages\n   support multicore programming at native or library level. C++11, the next\n   standard of the C++ programming language, also supports multithreading at a\n   low level. In this paper we argue for some extensions of the C++ Standard\n   Template Library based on the features of C++11. These extensions enhance\n   the standard library to be more powerful in the multicore realm. Our\n   approach is based on functors and lambda expressions, which are major\n   extensions in the language. We contribute three case studies: how to\n   efficiently compose functors in pipelines, how to evaluate boolean operators\n   in parallel, and how to efficiently accumulate over associative functors.<\/jats:p>","DOI":"10.2298\/csis111231027s","type":"journal-article","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T05:53:47Z","timestamp":1343454827000},"page":"1187-1202","source":"Crossref","is-referenced-by-count":0,"title":["High-level multicore programming with C++11"],"prefix":"10.2298","volume":"9","author":[{"given":"Zal\u00e1n","family":"Sz\u0171gyi","sequence":"first","affiliation":[{"name":"Department of Programming Languages and Compilers, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rk","family":"T\u00f6r\u00f6k","sequence":"additional","affiliation":[{"name":"Department of Programming Languages and Compilers, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Pataki","sequence":"additional","affiliation":[{"name":"Department of Programming Languages and Compilers, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kozsik","sequence":"additional","affiliation":[{"name":"Department of Programming Languages and Compilers, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:40Z","timestamp":1685349040000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141200027S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012]]}},"URL":"https:\/\/doi.org\/10.2298\/csis111231027s","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}