{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:07:59Z","timestamp":1780456079148,"version":"3.54.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319455495","type":"print"},{"value":"9783319455501","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45550-1_9","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:49:52Z","timestamp":1474368592000},"page":"116-129","source":"Crossref","is-referenced-by-count":9,"title":["Towards Unifying OpenMP Under the Task-Parallel Paradigm"],"prefix":"10.1007","author":[{"given":"Artur","family":"Podobas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sven","family":"Karlsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Acar, U.A., Blelloch, G.E., Blumofe, R.D.: The data locality of work stealing. In: Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/341800.341801"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-44587-0_1","volume-title":"OpenMP Shared Memory Parallel Programming","author":"V Aslot","year":"2001","unstructured":"Aslot, V., Domeika, M., Eigenmann, R., Gaertner, G., Jones, W.B., Parady, B.: SPEComp: a new benchmark suite for measuring parallel computer performance. In: Eigenmann, R., Voss, M.J. (eds.) WOMPAT 2001. LNCS, vol. 2104, pp. 1\u201310. Springer, Heidelberg (2001)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TPDS.2008.105","volume":"20","author":"E Ayguad\u00e9","year":"2009","unstructured":"Ayguad\u00e9, E., Copty, N., Duran, A., Hoeflinger, J., Lin, Y., Massaioli, F., Teruel, X., Unnikrishnan, P., Zhang, G.: The design of OpenMP tasks. IEEE Trans. Parallel Distrib. Syst. 20(3), 404\u2013418 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR4","unstructured":"Bienia, C., Li, K.: PARSEC 2.0: a new benchmark suite for chip-multiprocessors. In: Proceedings of the Annual Workshop on Modeling, Benchmarking and Simulation, vol. 2011 (2009)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bohme, D., Wolf, F., Supinski, D., Bronis, R., Schulz, M., Geimer, M.: Scalable critical-path based performance analysis. In: Proceedings of Parallel & Distributed Processing Symposium, pp. 1330\u20131340. IEEE (2012)","DOI":"10.1109\/IPDPS.2012.120"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-24595-9_11","volume-title":"OpenMP: Heterogenous Execution and Data Movements","author":"L Bonnichsen","year":"2015","unstructured":"Bonnichsen, L., Podobas, A.: Using transactional memory to avoid blocking in OpenMP synchronization directives. In: Terboven, C., et al. (eds.) IWOMP 2015. LNCS, vol. 9342, pp. 149\u2013161. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24595-9_11"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Che, S., Boyer, M., Meng, J., Tarjan, D., Sheaffer, J.W., Lee, S.-H., Skadron, K.: Rodinia: a benchmark suite for heterogeneous computing. In: Proceedings of IEEE International Symposium on Workload Characterization, pp. 44\u201354. IEEE (2009)","DOI":"10.1109\/IISWC.2009.5306797"},{"issue":"02","key":"9_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0129626411000151","volume":"21","author":"A Duran","year":"2011","unstructured":"Duran, A., Ayguad\u00e9, E., Badia, R.M., Labarta, J., Martinell, L., Martorell, X., Planas, J.: OmpSs: a proposal for programming heterogeneous multi-core architectures. Parallel Process. Lett. 21(02), 173\u2013193 (2011)","journal-title":"Parallel Process. Lett."},{"issue":"1","key":"9_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1006\/jpdc.1996.0104","volume":"37","author":"SC Goldstein","year":"1996","unstructured":"Goldstein, S.C., Schauser, K.E., Culler, D.E.: Lazy threads: implementing a fast parallel call. J. Parallel Distrib. Comput. 37(1), 5\u201320 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez, C.H., Fraguela, B.B.: A generic algorithm template for divide-and-conquer in multicore systems. In: Proceedings of IEEE International Conference on High Performance Computing and Communications, pp. 79\u201388. IEEE (2010)","DOI":"10.1109\/HPCC.2010.24"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-36574-5_9","volume-title":"Algorithms for Memory Hierarchies","author":"P Kumar","year":"2003","unstructured":"Kumar, P.: Cache oblivious algorithms. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 193\u2013212. Springer, Heidelberg (2003)"},{"issue":"3","key":"9_CR12","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/s11227-010-0405-3","volume":"51","author":"CE Leiserson","year":"2010","unstructured":"Leiserson, C.E.: The Cilk++ concurrency platform. J. Supercomput. 51(3), 244\u2013257 (2010)","journal-title":"J. Supercomput."},{"issue":"3","key":"9_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/71.86103","volume":"2","author":"E Mohr","year":"1991","unstructured":"Mohr, E., Kranz, D.A., Halstead Jr., R.H.: Lazy task creation: a technique for increasing the granularity of parallel programs. IEEE Trans. Parallel Distrib. Syst. 2(3), 264\u2013280 (1991)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-319-11454-5_4","volume-title":"Using and Improving OpenMP for Devices, Tasks, and More","author":"A Podobas","year":"2014","unstructured":"Podobas, A., Brorsson, M., Vlassov, V.: TurboB\u0141YSK: scheduling for improved data-driven task performance with fast dependency resolution. In: DeRose, L., Supinski, B.R., Olivier, S.L., Chapman, B.M., M\u00fcller, M.S. (eds.) IWOMP 2014. LNCS, vol. 8766, pp. 45\u201357. Springer, Heidelberg (2014)"},{"issue":"12","key":"9_CR15","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/TC.1987.5009495","volume":"100","author":"CD Polychronopoulos","year":"1987","unstructured":"Polychronopoulos, C.D., Kuck, D.J.: Guided self-scheduling: a practical scheduling scheme for parallel supercomputers. IEEE Trans. Comput. 100(12), 1425\u20131439 (1987)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"9_CR16","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/71.205655","volume":"4","author":"HT Tzen","year":"1993","unstructured":"Tzen, H.T., Ni, L.M.: Trapezoid self-scheduling: a practical scheduling scheme for parallel compilers. IEEE Trans. Parallel Distrib. Syst. 4(1), 87\u201398 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR17","unstructured":"Zhang, Y., Burcea, M., Cheng, V., Ho, R., Voss, M.: An adaptive OpenMP loop scheduler for hyperthreaded SMPs. In: Proceedings of International Conference on Parallel and Distributed Computing (and Communications) Systems, pp. 256\u2013263 (2004)"},{"key":"9_CR18","unstructured":"Zhang, Y., Voss, M., Rogers, E.S.: Runtime empirical selection of loop schedulers on hyperthreaded smps. In: Proceedings of International Parallel and Distributed Processing Symposium, p. 44b. IEEE (2005)"}],"container-title":["Lecture Notes in Computer Science","OpenMP: Memory, Devices, and Tasks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45550-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:13:58Z","timestamp":1498346038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45550-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319455495","9783319455501"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45550-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}